./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51414ee3807ca1fd23d912ce863e20c8474e29a0fd6d368c05bcc9b8c4cb2be2
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:36:13,217 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:36:13,219 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:36:13,256 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:36:13,277 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:36:13,280 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:36:13,282 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:36:13,284 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:36:13,286 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:36:13,291 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:36:13,292 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:36:13,294 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:36:13,294 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:36:13,297 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:36:13,299 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:36:13,300 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:36:13,302 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:36:13,302 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:36:13,303 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:36:13,313 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:36:13,314 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:36:13,316 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:36:13,316 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:36:13,317 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:36:13,322 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:36:13,322 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:36:13,323 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:36:13,324 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:36:13,337 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:36:13,339 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:36:13,339 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:36:13,340 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:36:13,342 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:36:13,343 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:36:13,344 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:36:13,344 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:36:13,344 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:36:13,345 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:36:13,345 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:36:13,346 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:36:13,347 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:36:13,347 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 08:36:13,395 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:36:13,395 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:36:13,396 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:36:13,396 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:36:13,397 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:36:13,397 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:36:13,397 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:36:13,397 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:36:13,398 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:36:13,398 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:36:13,398 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:36:13,399 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:36:13,400 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:36:13,400 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:36:13,400 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:36:13,400 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:36:13,400 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:36:13,400 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:36:13,401 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:36:13,401 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:36:13,401 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:36:13,401 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:36:13,401 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:36:13,402 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:36:13,402 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:36:13,402 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:36:13,403 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:36:13,403 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:36:13,403 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:36:13,403 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:36:13,403 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:36:13,403 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51414ee3807ca1fd23d912ce863e20c8474e29a0fd6d368c05bcc9b8c4cb2be2
[2023-10-26 08:36:13,795 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:36:13,817 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:36:13,819 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:36:13,820 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:36:13,820 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:36:13,821 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2023-10-26 08:36:15,468 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:36:15,856 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:36:15,865 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2023-10-26 08:36:15,883 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/10767a5d0/2cad02f275a74c149d9ba297958709f8/FLAG10db4b01a
[2023-10-26 08:36:15,905 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/10767a5d0/2cad02f275a74c149d9ba297958709f8
[2023-10-26 08:36:15,919 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:36:15,921 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:36:15,921 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:36:15,922 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:36:15,924 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:36:15,924 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:36:15" (1/1) ...
[2023-10-26 08:36:15,925 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c636864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:15, skipping insertion in model container
[2023-10-26 08:36:15,926 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:36:15" (1/1) ...
[2023-10-26 08:36:15,950 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:36:16,032 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:36:16,267 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:36:16,630 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:36:16,644 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:36:16,677 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:36:16,734 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:36:16,812 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:36:16,813 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16 WrapperNode
[2023-10-26 08:36:16,813 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:36:16,814 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:36:16,814 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:36:16,814 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:36:16,832 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,856 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,906 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-10-26 08:36:16,907 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:36:16,907 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:36:16,908 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:36:16,919 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:36:16,926 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,926 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,939 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,941 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,947 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,970 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,974 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,980 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:16,982 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:36:16,998 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:36:16,999 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:36:16,999 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:36:17,000 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (1/1) ...
[2023-10-26 08:36:17,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:36:17,014 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:36:17,053 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 08:36:17,090 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 08:36:17,111 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:36:17,118 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:36:17,119 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:36:17,120 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:36:17,121 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:36:17,121 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:36:17,121 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:36:17,121 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:36:17,121 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:36:17,122 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:36:17,122 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:36:17,123 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:36:17,354 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:36:17,359 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:36:17,782 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:36:17,803 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:36:17,805 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:36:17,807 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:36:17 BoogieIcfgContainer
[2023-10-26 08:36:17,807 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:36:17,809 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:36:17,809 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:36:17,811 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:36:17,812 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:36:15" (1/3) ...
[2023-10-26 08:36:17,812 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ccd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:36:17, skipping insertion in model container
[2023-10-26 08:36:17,812 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:36:16" (2/3) ...
[2023-10-26 08:36:17,813 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ccd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:36:17, skipping insertion in model container
[2023-10-26 08:36:17,814 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:36:17" (3/3) ...
[2023-10-26 08:36:17,815 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2023-10-26 08:36:17,827 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:36:17,848 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:36:17,848 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-26 08:36:17,848 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:36:17,977 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:36:18,063 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2023-10-26 08:36:18,180 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2023-10-26 08:36:18,189 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:36:18,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-26 08:36:18,194 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 240 flow
[2023-10-26 08:36:18,199 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 240 flow
[2023-10-26 08:36:18,206 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:36:18,213 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 116 transitions, 240 flow
[2023-10-26 08:36:18,228 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 116 transitions, 240 flow
[2023-10-26 08:36:18,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2023-10-26 08:36:18,275 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2023-10-26 08:36:18,289 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:36:18,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-26 08:36:18,293 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2166
[2023-10-26 08:36:21,487 INFO  L134        LiptonReduction]: Checked pairs total: 11903
[2023-10-26 08:36:21,488 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-26 08:36:21,508 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:36:21,514 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dca86f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:36:21,519 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-26 08:36:21,526 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-26 08:36:21,526 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:36:21,526 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:21,527 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-26 08:36:21,527 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-26 08:36:21,531 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:21,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 384, now seen corresponding path program 1 times
[2023-10-26 08:36:21,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:21,543 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441861393]
[2023-10-26 08:36:21,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:21,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:21,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:21,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:21,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:21,703 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441861393]
[2023-10-26 08:36:21,704 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441861393] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:21,704 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:21,704 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-26 08:36:21,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116919082]
[2023-10-26 08:36:21,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:21,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:36:21,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:21,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:36:21,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:36:21,766 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194
[2023-10-26 08:36:21,769 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:21,769 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:21,769 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194
[2023-10-26 08:36:21,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:21,888 INFO  L130       PetriNetUnfolder]: 29/222 cut-off events.
[2023-10-26 08:36:21,888 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2023-10-26 08:36:21,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 222 events. 29/222 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1154 event pairs, 28 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 249. Up to 78 conditions per place. 
[2023-10-26 08:36:21,892 INFO  L137   encePairwiseOnDemand]: 193/194 looper letters, 15 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-10-26 08:36:21,893 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 136 flow
[2023-10-26 08:36:21,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:36:21,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:36:21,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions.
[2023-10-26 08:36:21,916 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6134020618556701
[2023-10-26 08:36:21,917 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 238 transitions.
[2023-10-26 08:36:21,917 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions.
[2023-10-26 08:36:21,919 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:21,922 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions.
[2023-10-26 08:36:21,928 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:21,950 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:21,951 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:21,952 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 238 transitions.
[2023-10-26 08:36:21,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 136 flow
[2023-10-26 08:36:21,955 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:21,957 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-10-26 08:36:21,959 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2023-10-26 08:36:21,961 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-10-26 08:36:21,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-10-26 08:36:21,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:21,962 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:21,962 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:21,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:36:21,963 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-26 08:36:21,965 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:21,965 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667475177, now seen corresponding path program 1 times
[2023-10-26 08:36:21,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:21,968 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851415089]
[2023-10-26 08:36:21,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:21,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:22,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:22,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:22,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:22,801 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851415089]
[2023-10-26 08:36:22,802 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851415089] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:22,802 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:22,805 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:22,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72383863]
[2023-10-26 08:36:22,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:22,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:22,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:22,807 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:22,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:23,064 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194
[2023-10-26 08:36:23,064 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,064 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:23,064 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194
[2023-10-26 08:36:23,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:23,334 INFO  L130       PetriNetUnfolder]: 212/632 cut-off events.
[2023-10-26 08:36:23,335 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2023-10-26 08:36:23,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 632 events. 212/632 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3642 event pairs, 63 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 1154. Up to 276 conditions per place. 
[2023-10-26 08:36:23,342 INFO  L137   encePairwiseOnDemand]: 171/194 looper letters, 57 selfloop transitions, 29 changer transitions 0/100 dead transitions.
[2023-10-26 08:36:23,342 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 383 flow
[2023-10-26 08:36:23,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:23,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:23,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions.
[2023-10-26 08:36:23,359 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5197594501718213
[2023-10-26 08:36:23,359 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 605 transitions.
[2023-10-26 08:36:23,360 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions.
[2023-10-26 08:36:23,360 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:23,360 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions.
[2023-10-26 08:36:23,362 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,365 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,366 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 605 transitions.
[2023-10-26 08:36:23,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 383 flow
[2023-10-26 08:36:23,368 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:23,374 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-10-26 08:36:23,374 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2023-10-26 08:36:23,375 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-10-26 08:36:23,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-10-26 08:36:23,375 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,389 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:23,389 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:23,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:36:23,390 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-26 08:36:23,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:23,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -946268794, now seen corresponding path program 1 times
[2023-10-26 08:36:23,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:23,393 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315521440]
[2023-10-26 08:36:23,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:23,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:23,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:23,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:23,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:23,432 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315521440]
[2023-10-26 08:36:23,432 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315521440] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:23,432 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:23,433 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:36:23,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438841970]
[2023-10-26 08:36:23,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:23,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:36:23,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:23,451 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:36:23,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:36:23,462 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 194
[2023-10-26 08:36:23,462 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,463 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:23,463 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 194
[2023-10-26 08:36:23,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:23,685 INFO  L130       PetriNetUnfolder]: 128/491 cut-off events.
[2023-10-26 08:36:23,685 INFO  L131       PetriNetUnfolder]: For 115/126 co-relation queries the response was YES.
[2023-10-26 08:36:23,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 491 events. 128/491 cut-off events. For 115/126 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2713 event pairs, 10 based on Foata normal form. 14/475 useless extension candidates. Maximal degree in co-relation 1102. Up to 142 conditions per place. 
[2023-10-26 08:36:23,688 INFO  L137   encePairwiseOnDemand]: 190/194 looper letters, 26 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-10-26 08:36:23,688 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 396 flow
[2023-10-26 08:36:23,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:36:23,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:36:23,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions.
[2023-10-26 08:36:23,690 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5824742268041238
[2023-10-26 08:36:23,690 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 339 transitions.
[2023-10-26 08:36:23,690 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions.
[2023-10-26 08:36:23,690 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:23,691 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions.
[2023-10-26 08:36:23,691 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,692 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,693 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,701 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 339 transitions.
[2023-10-26 08:36:23,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 396 flow
[2023-10-26 08:36:23,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:23,709 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-10-26 08:36:23,710 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2023-10-26 08:36:23,719 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-10-26 08:36:23,719 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-10-26 08:36:23,719 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:23,719 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:23,720 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:23,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:36:23,720 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-26 08:36:23,720 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:23,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190871734, now seen corresponding path program 1 times
[2023-10-26 08:36:23,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:23,721 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768978764]
[2023-10-26 08:36:23,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:23,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:23,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:24,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:24,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:24,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768978764]
[2023-10-26 08:36:24,150 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768978764] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:24,150 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:24,150 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:24,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314691398]
[2023-10-26 08:36:24,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:24,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:24,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:24,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:24,153 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:24,477 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 194
[2023-10-26 08:36:24,478 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:24,478 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:24,478 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 194
[2023-10-26 08:36:24,479 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:24,682 INFO  L130       PetriNetUnfolder]: 209/640 cut-off events.
[2023-10-26 08:36:24,683 INFO  L131       PetriNetUnfolder]: For 285/289 co-relation queries the response was YES.
[2023-10-26 08:36:24,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 640 events. 209/640 cut-off events. For 285/289 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3496 event pairs, 45 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 1636. Up to 328 conditions per place. 
[2023-10-26 08:36:24,686 INFO  L137   encePairwiseOnDemand]: 183/194 looper letters, 45 selfloop transitions, 33 changer transitions 8/124 dead transitions.
[2023-10-26 08:36:24,686 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 703 flow
[2023-10-26 08:36:24,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:24,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:24,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-10-26 08:36:24,688 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5455326460481099
[2023-10-26 08:36:24,688 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-10-26 08:36:24,688 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-10-26 08:36:24,689 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:24,689 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-10-26 08:36:24,690 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:24,692 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:24,692 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:24,705 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-10-26 08:36:24,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 703 flow
[2023-10-26 08:36:24,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 703 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:24,715 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-10-26 08:36:24,716 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2023-10-26 08:36:24,717 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-10-26 08:36:24,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-10-26 08:36:24,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:24,718 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:24,718 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:24,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:36:24,719 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-26 08:36:24,719 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:24,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -277895401, now seen corresponding path program 1 times
[2023-10-26 08:36:24,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:24,720 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762940315]
[2023-10-26 08:36:24,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:24,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:24,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:25,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:25,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:25,200 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762940315]
[2023-10-26 08:36:25,200 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762940315] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:25,200 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:25,201 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:25,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176628541]
[2023-10-26 08:36:25,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:25,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:25,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:25,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:25,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:25,366 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 194
[2023-10-26 08:36:25,366 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:25,367 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:25,367 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 194
[2023-10-26 08:36:25,367 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:25,806 INFO  L130       PetriNetUnfolder]: 361/945 cut-off events.
[2023-10-26 08:36:25,806 INFO  L131       PetriNetUnfolder]: For 732/740 co-relation queries the response was YES.
[2023-10-26 08:36:25,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 945 events. 361/945 cut-off events. For 732/740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5703 event pairs, 74 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 3070. Up to 656 conditions per place. 
[2023-10-26 08:36:25,812 INFO  L137   encePairwiseOnDemand]: 172/194 looper letters, 103 selfloop transitions, 76 changer transitions 20/214 dead transitions.
[2023-10-26 08:36:25,815 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 214 transitions, 1493 flow
[2023-10-26 08:36:25,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:25,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:25,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions.
[2023-10-26 08:36:25,817 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5395189003436426
[2023-10-26 08:36:25,817 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 628 transitions.
[2023-10-26 08:36:25,817 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions.
[2023-10-26 08:36:25,818 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:25,818 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions.
[2023-10-26 08:36:25,826 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:25,828 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:25,829 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:25,830 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 628 transitions.
[2023-10-26 08:36:25,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 214 transitions, 1493 flow
[2023-10-26 08:36:25,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 214 transitions, 1493 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:25,853 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-10-26 08:36:25,854 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2023-10-26 08:36:25,855 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-10-26 08:36:25,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-10-26 08:36:25,856 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:25,856 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:25,856 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:36:25,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:36:25,858 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-26 08:36:25,858 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:25,858 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529204463, now seen corresponding path program 1 times
[2023-10-26 08:36:25,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:25,858 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216661971]
[2023-10-26 08:36:25,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:25,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:25,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:36:25,905 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:36:25,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:36:25,979 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:36:25,980 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:36:25,981 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-26 08:36:25,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-26 08:36:25,997 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-26 08:36:25,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-26 08:36:25,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-26 08:36:25,998 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-26 08:36:26,001 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-26 08:36:26,002 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-26 08:36:26,002 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-26 08:36:26,003 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-26 08:36:26,003 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-26 08:36:26,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:36:26,004 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:26,007 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:36:26,007 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:36:26,046 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:36:26,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2023-10-26 08:36:26,087 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2023-10-26 08:36:26,101 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:36:26,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2023-10-26 08:36:26,102 INFO  L82        GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 292 flow
[2023-10-26 08:36:26,103 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 292 flow
[2023-10-26 08:36:26,103 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:36:26,104 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 137 transitions, 292 flow
[2023-10-26 08:36:26,104 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 137 transitions, 292 flow
[2023-10-26 08:36:26,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2023-10-26 08:36:26,145 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2023-10-26 08:36:26,145 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:36:26,146 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2023-10-26 08:36:26,149 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5548
[2023-10-26 08:36:29,327 INFO  L134        LiptonReduction]: Checked pairs total: 29998
[2023-10-26 08:36:29,327 INFO  L136        LiptonReduction]: Total number of compositions: 86
[2023-10-26 08:36:29,328 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:36:29,333 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dca86f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:36:29,334 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-10-26 08:36:29,334 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-26 08:36:29,335 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:36:29,335 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:29,335 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-26 08:36:29,336 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:29,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:29,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 627, now seen corresponding path program 1 times
[2023-10-26 08:36:29,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:29,350 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261133870]
[2023-10-26 08:36:29,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:29,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:29,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:29,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:29,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:29,362 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261133870]
[2023-10-26 08:36:29,362 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261133870] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:29,362 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:29,363 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-26 08:36:29,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072950660]
[2023-10-26 08:36:29,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:29,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:36:29,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:29,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:36:29,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:36:29,365 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 223
[2023-10-26 08:36:29,366 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:29,366 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:29,366 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 223
[2023-10-26 08:36:29,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:29,644 INFO  L130       PetriNetUnfolder]: 363/1129 cut-off events.
[2023-10-26 08:36:29,657 INFO  L131       PetriNetUnfolder]: For 94/181 co-relation queries the response was YES.
[2023-10-26 08:36:29,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1129 events. 363/1129 cut-off events. For 94/181 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7294 event pairs, 356 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1476. Up to 647 conditions per place. 
[2023-10-26 08:36:29,662 INFO  L137   encePairwiseOnDemand]: 222/223 looper letters, 21 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-10-26 08:36:29,662 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 186 flow
[2023-10-26 08:36:29,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:36:29,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:36:29,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions.
[2023-10-26 08:36:29,664 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6322869955156951
[2023-10-26 08:36:29,664 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 282 transitions.
[2023-10-26 08:36:29,664 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions.
[2023-10-26 08:36:29,664 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:29,664 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions.
[2023-10-26 08:36:29,665 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:29,666 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:29,666 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:29,666 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 282 transitions.
[2023-10-26 08:36:29,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 186 flow
[2023-10-26 08:36:29,667 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:29,670 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-10-26 08:36:29,670 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2023-10-26 08:36:29,681 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-10-26 08:36:29,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-10-26 08:36:29,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:29,683 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:29,684 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:29,684 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:36:29,684 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:29,684 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:29,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -1479847002, now seen corresponding path program 1 times
[2023-10-26 08:36:29,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:29,685 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081869211]
[2023-10-26 08:36:29,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:29,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:29,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:29,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:29,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:29,914 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081869211]
[2023-10-26 08:36:29,914 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081869211] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:29,914 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:29,914 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:29,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271456905]
[2023-10-26 08:36:29,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:29,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:29,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:29,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:29,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:30,121 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 223
[2023-10-26 08:36:30,122 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:30,122 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:30,122 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 223
[2023-10-26 08:36:30,122 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:31,733 INFO  L130       PetriNetUnfolder]: 5489/10606 cut-off events.
[2023-10-26 08:36:31,733 INFO  L131       PetriNetUnfolder]: For 254/289 co-relation queries the response was YES.
[2023-10-26 08:36:31,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19874 conditions, 10606 events. 5489/10606 cut-off events. For 254/289 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80178 event pairs, 1459 based on Foata normal form. 16/9949 useless extension candidates. Maximal degree in co-relation 19869. Up to 5638 conditions per place. 
[2023-10-26 08:36:31,817 INFO  L137   encePairwiseOnDemand]: 196/223 looper letters, 91 selfloop transitions, 48 changer transitions 0/157 dead transitions.
[2023-10-26 08:36:31,833 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 157 transitions, 621 flow
[2023-10-26 08:36:31,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:31,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:31,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions.
[2023-10-26 08:36:31,844 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5590433482810164
[2023-10-26 08:36:31,844 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 748 transitions.
[2023-10-26 08:36:31,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions.
[2023-10-26 08:36:31,844 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:31,844 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions.
[2023-10-26 08:36:31,846 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:31,850 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:31,850 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:31,851 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 748 transitions.
[2023-10-26 08:36:31,851 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 157 transitions, 621 flow
[2023-10-26 08:36:31,852 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 157 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:31,867 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-10-26 08:36:31,868 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-26 08:36:31,869 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-26 08:36:31,869 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-10-26 08:36:31,870 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:31,870 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:31,870 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:31,870 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-26 08:36:31,870 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:31,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:31,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -576895935, now seen corresponding path program 1 times
[2023-10-26 08:36:31,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:31,871 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824965898]
[2023-10-26 08:36:31,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:31,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:31,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:31,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:31,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:31,907 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824965898]
[2023-10-26 08:36:31,907 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824965898] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:31,907 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:31,907 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:36:31,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708607311]
[2023-10-26 08:36:31,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:31,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:36:31,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:31,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:36:31,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:36:31,933 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2023-10-26 08:36:31,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:31,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:31,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2023-10-26 08:36:31,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:32,780 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_37 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65 1))) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_65)) |v_threadThread1of2ForFork0_#t~nondet4_28|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_65))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65)))))  InVars {#race=|v_#race_73|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_28|, ~datas~0.offset=v_~datas~0.offset_65}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_15|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, ~datas~0.offset=v_~datas~0.offset_65}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [51#threadEXITtrue, 140#true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 157#(= |#race~datas~0| 0), threadThread1of2ForFork0InUse, 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 102#L1017-4true, threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2023-10-26 08:36:32,781 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,781 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,781 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,781 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,782 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L1017-4-->L1017-6: Formula: (= (store |v_#race_66| v_~datas~0.base_65 (store (select |v_#race_66| v_~datas~0.base_65) (+ (* v_threadThread2of2ForFork0_~i~0_33 4) v_~datas~0.offset_57) |v_threadThread2of2ForFork0_#t~nondet4_23|)) |v_#race_65|)  InVars {#race=|v_#race_66|, ~datas~0.base=v_~datas~0.base_65, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  OutVars{#race=|v_#race_65|, ~datas~0.base=v_~datas~0.base_65, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_23|, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [140#true, 20#L1017-9true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 28#L1017-6true, 157#(= |#race~datas~0| 0), 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2023-10-26 08:36:32,782 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:36:32,959 INFO  L130       PetriNetUnfolder]: 2751/6464 cut-off events.
[2023-10-26 08:36:32,959 INFO  L131       PetriNetUnfolder]: For 2006/2564 co-relation queries the response was YES.
[2023-10-26 08:36:32,985 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 6464 events. 2751/6464 cut-off events. For 2006/2564 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53340 event pairs, 950 based on Foata normal form. 125/6165 useless extension candidates. Maximal degree in co-relation 14852. Up to 2371 conditions per place. 
[2023-10-26 08:36:33,014 INFO  L137   encePairwiseOnDemand]: 217/223 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-10-26 08:36:33,029 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-10-26 08:36:33,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:36:33,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:36:33,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2023-10-26 08:36:33,031 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5919282511210763
[2023-10-26 08:36:33,031 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2023-10-26 08:36:33,031 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2023-10-26 08:36:33,032 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:33,032 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2023-10-26 08:36:33,033 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:33,034 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:33,034 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:33,034 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 396 transitions.
[2023-10-26 08:36:33,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-10-26 08:36:33,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:33,075 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-10-26 08:36:33,085 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-26 08:36:33,087 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-26 08:36:33,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-10-26 08:36:33,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:33,087 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:33,087 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:33,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-26 08:36:33,088 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:33,088 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:33,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 594333784, now seen corresponding path program 1 times
[2023-10-26 08:36:33,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:33,088 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982611605]
[2023-10-26 08:36:33,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:33,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:33,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:33,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:33,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:33,381 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982611605]
[2023-10-26 08:36:33,382 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982611605] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:33,382 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:33,382 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:33,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553799481]
[2023-10-26 08:36:33,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:33,383 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:33,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:33,384 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:33,384 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:33,686 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 223
[2023-10-26 08:36:33,687 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:33,687 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:33,687 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 223
[2023-10-26 08:36:33,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:35,351 INFO  L130       PetriNetUnfolder]: 5567/10624 cut-off events.
[2023-10-26 08:36:35,351 INFO  L131       PetriNetUnfolder]: For 6462/6560 co-relation queries the response was YES.
[2023-10-26 08:36:35,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28208 conditions, 10624 events. 5567/10624 cut-off events. For 6462/6560 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 79146 event pairs, 1759 based on Foata normal form. 0/10089 useless extension candidates. Maximal degree in co-relation 28197. Up to 6791 conditions per place. 
[2023-10-26 08:36:35,461 INFO  L137   encePairwiseOnDemand]: 208/223 looper letters, 108 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-10-26 08:36:35,474 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1309 flow
[2023-10-26 08:36:35,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:35,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:35,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-10-26 08:36:35,477 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5747384155455905
[2023-10-26 08:36:35,477 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-10-26 08:36:35,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-10-26 08:36:35,477 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:35,477 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-10-26 08:36:35,479 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:35,481 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:35,481 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:35,481 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 769 transitions.
[2023-10-26 08:36:35,481 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1309 flow
[2023-10-26 08:36:35,515 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1309 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:35,528 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-10-26 08:36:35,528 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2023-10-26 08:36:35,529 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-10-26 08:36:35,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-10-26 08:36:35,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:35,529 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:35,545 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:35,545 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-26 08:36:35,546 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:35,546 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:35,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171520631, now seen corresponding path program 1 times
[2023-10-26 08:36:35,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:35,548 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289263729]
[2023-10-26 08:36:35,548 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:35,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:35,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:35,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:35,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:35,982 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289263729]
[2023-10-26 08:36:35,983 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289263729] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:35,983 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:35,983 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:35,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377094769]
[2023-10-26 08:36:35,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:35,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:35,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:35,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:35,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:36,211 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2023-10-26 08:36:36,212 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:36,212 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:36,212 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2023-10-26 08:36:36,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:38,611 INFO  L130       PetriNetUnfolder]: 11107/19827 cut-off events.
[2023-10-26 08:36:38,611 INFO  L131       PetriNetUnfolder]: For 18082/18251 co-relation queries the response was YES.
[2023-10-26 08:36:38,638 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62978 conditions, 19827 events. 11107/19827 cut-off events. For 18082/18251 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 151288 event pairs, 3140 based on Foata normal form. 8/18548 useless extension candidates. Maximal degree in co-relation 62962. Up to 13610 conditions per place. 
[2023-10-26 08:36:39,080 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 233 selfloop transitions, 132 changer transitions 0/385 dead transitions.
[2023-10-26 08:36:39,080 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 385 transitions, 2911 flow
[2023-10-26 08:36:39,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:39,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:39,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2023-10-26 08:36:39,083 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2023-10-26 08:36:39,083 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2023-10-26 08:36:39,083 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2023-10-26 08:36:39,083 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:39,083 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2023-10-26 08:36:39,085 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:39,087 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:39,088 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:39,088 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 779 transitions.
[2023-10-26 08:36:39,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 385 transitions, 2911 flow
[2023-10-26 08:36:39,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 385 transitions, 2911 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:39,193 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-10-26 08:36:39,194 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2023-10-26 08:36:39,194 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-10-26 08:36:39,194 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-10-26 08:36:39,195 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:39,195 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:39,195 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:39,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-26 08:36:39,195 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:39,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:39,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -485975421, now seen corresponding path program 1 times
[2023-10-26 08:36:39,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:39,196 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232144674]
[2023-10-26 08:36:39,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:39,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:39,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:39,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:36:39,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:39,755 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232144674]
[2023-10-26 08:36:39,755 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232144674] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:36:39,757 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058331649]
[2023-10-26 08:36:39,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:39,757 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:36:39,758 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:36:39,781 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:36:39,816 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-26 08:36:39,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:39,946 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-26 08:36:39,949 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:36:40,268 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:36:40,311 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,312 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:36:40,367 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,368 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,369 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:36:40,421 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,422 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,424 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:36:40,485 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:36:40,486 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:36:40,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:36:40,526 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:36:40,584 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-10-26 08:36:40,621 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-26 08:36:40,644 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-10-26 08:36:40,763 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:36:40,763 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-26 08:36:40,772 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:36:40,773 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-26 08:36:40,776 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-26 08:36:40,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-10-26 08:36:40,807 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058331649] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:36:40,807 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:36:40,807 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-10-26 08:36:40,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329478763]
[2023-10-26 08:36:40,807 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:36:40,808 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-10-26 08:36:40,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:40,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-10-26 08:36:40,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=131, Unknown=10, NotChecked=84, Total=306
[2023-10-26 08:36:40,968 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 223
[2023-10-26 08:36:40,969 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:40,969 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:40,969 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 223
[2023-10-26 08:36:40,969 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:44,670 INFO  L130       PetriNetUnfolder]: 13643/23034 cut-off events.
[2023-10-26 08:36:44,670 INFO  L131       PetriNetUnfolder]: For 42400/42404 co-relation queries the response was YES.
[2023-10-26 08:36:44,745 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89032 conditions, 23034 events. 13643/23034 cut-off events. For 42400/42404 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 165617 event pairs, 5631 based on Foata normal form. 498/22055 useless extension candidates. Maximal degree in co-relation 89011. Up to 21318 conditions per place. 
[2023-10-26 08:36:44,945 INFO  L137   encePairwiseOnDemand]: 206/223 looper letters, 323 selfloop transitions, 7 changer transitions 11/350 dead transitions.
[2023-10-26 08:36:44,945 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 350 transitions, 3329 flow
[2023-10-26 08:36:44,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:36:44,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:36:44,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions.
[2023-10-26 08:36:44,949 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41832158872517616
[2023-10-26 08:36:44,949 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 653 transitions.
[2023-10-26 08:36:44,949 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions.
[2023-10-26 08:36:44,950 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:44,950 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions.
[2023-10-26 08:36:44,951 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:44,967 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:44,967 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:44,967 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 653 transitions.
[2023-10-26 08:36:44,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 350 transitions, 3329 flow
[2023-10-26 08:36:45,552 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 350 transitions, 3233 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:45,556 INFO  L231             Difference]: Finished difference. Result has 103 places, 303 transitions, 2290 flow
[2023-10-26 08:36:45,557 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2290, PETRI_PLACES=103, PETRI_TRANSITIONS=303}
[2023-10-26 08:36:45,557 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 36 predicate places.
[2023-10-26 08:36:45,557 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 303 transitions, 2290 flow
[2023-10-26 08:36:45,558 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:45,558 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:45,558 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:45,566 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-26 08:36:45,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-26 08:36:45,763 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:45,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:45,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -834187754, now seen corresponding path program 1 times
[2023-10-26 08:36:45,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:45,765 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346379759]
[2023-10-26 08:36:45,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:45,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:45,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:46,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:36:46,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:46,233 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346379759]
[2023-10-26 08:36:46,234 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346379759] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:46,234 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:46,234 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-26 08:36:46,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469235752]
[2023-10-26 08:36:46,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:46,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-26 08:36:46,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:46,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-26 08:36:46,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-26 08:36:46,692 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 223
[2023-10-26 08:36:46,693 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 303 transitions, 2290 flow. Second operand  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:46,693 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:46,693 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 223
[2023-10-26 08:36:46,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:50,554 INFO  L130       PetriNetUnfolder]: 13295/23434 cut-off events.
[2023-10-26 08:36:50,555 INFO  L131       PetriNetUnfolder]: For 42124/42205 co-relation queries the response was YES.
[2023-10-26 08:36:50,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92527 conditions, 23434 events. 13295/23434 cut-off events. For 42124/42205 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 181808 event pairs, 3483 based on Foata normal form. 350/23302 useless extension candidates. Maximal degree in co-relation 92501. Up to 11062 conditions per place. 
[2023-10-26 08:36:50,823 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 448 selfloop transitions, 166 changer transitions 1/632 dead transitions.
[2023-10-26 08:36:50,824 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 632 transitions, 5697 flow
[2023-10-26 08:36:50,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-26 08:36:50,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-26 08:36:50,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions.
[2023-10-26 08:36:50,829 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.547085201793722
[2023-10-26 08:36:50,829 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 976 transitions.
[2023-10-26 08:36:50,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 976 transitions.
[2023-10-26 08:36:50,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:50,830 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 976 transitions.
[2023-10-26 08:36:50,834 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:50,837 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:50,850 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:50,850 INFO  L175             Difference]: Start difference. First operand has 103 places, 303 transitions, 2290 flow. Second operand 8 states and 976 transitions.
[2023-10-26 08:36:50,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 632 transitions, 5697 flow
[2023-10-26 08:36:51,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 632 transitions, 5613 flow, removed 31 selfloop flow, removed 2 redundant places.
[2023-10-26 08:36:51,450 INFO  L231             Difference]: Finished difference. Result has 114 places, 420 transitions, 3916 flow
[2023-10-26 08:36:51,452 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=114, PETRI_TRANSITIONS=420}
[2023-10-26 08:36:51,452 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 47 predicate places.
[2023-10-26 08:36:51,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 420 transitions, 3916 flow
[2023-10-26 08:36:51,453 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:51,453 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:51,453 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:51,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-26 08:36:51,454 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:51,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:51,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 779781685, now seen corresponding path program 1 times
[2023-10-26 08:36:51,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:51,455 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44395486]
[2023-10-26 08:36:51,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:51,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:51,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:51,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-26 08:36:51,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:51,812 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44395486]
[2023-10-26 08:36:51,812 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44395486] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:51,812 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:36:51,812 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:36:51,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157376110]
[2023-10-26 08:36:51,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:51,813 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:36:51,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:51,813 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:36:51,813 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:36:52,014 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2023-10-26 08:36:52,015 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 420 transitions, 3916 flow. Second operand  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:52,015 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:36:52,015 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2023-10-26 08:36:52,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:36:57,579 INFO  L130       PetriNetUnfolder]: 17483/30558 cut-off events.
[2023-10-26 08:36:57,580 INFO  L131       PetriNetUnfolder]: For 117297/117885 co-relation queries the response was YES.
[2023-10-26 08:36:57,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141844 conditions, 30558 events. 17483/30558 cut-off events. For 117297/117885 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 244225 event pairs, 3898 based on Foata normal form. 68/28478 useless extension candidates. Maximal degree in co-relation 141812. Up to 23106 conditions per place. 
[2023-10-26 08:36:57,854 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 440 selfloop transitions, 164 changer transitions 1/622 dead transitions.
[2023-10-26 08:36:57,854 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 622 transitions, 6656 flow
[2023-10-26 08:36:57,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:36:57,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:36:57,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2023-10-26 08:36:57,857 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2023-10-26 08:36:57,857 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2023-10-26 08:36:57,857 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2023-10-26 08:36:57,858 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:36:57,858 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2023-10-26 08:36:57,862 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:57,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:57,867 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:57,867 INFO  L175             Difference]: Start difference. First operand has 114 places, 420 transitions, 3916 flow. Second operand 6 states and 779 transitions.
[2023-10-26 08:36:57,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 622 transitions, 6656 flow
[2023-10-26 08:36:58,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 622 transitions, 6618 flow, removed 19 selfloop flow, removed 0 redundant places.
[2023-10-26 08:36:58,588 INFO  L231             Difference]: Finished difference. Result has 123 places, 535 transitions, 5508 flow
[2023-10-26 08:36:58,588 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5508, PETRI_PLACES=123, PETRI_TRANSITIONS=535}
[2023-10-26 08:36:58,589 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 56 predicate places.
[2023-10-26 08:36:58,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 535 transitions, 5508 flow
[2023-10-26 08:36:58,590 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:36:58,590 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:36:58,590 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:36:58,590 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-26 08:36:58,590 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:36:58,591 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:36:58,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664645135, now seen corresponding path program 1 times
[2023-10-26 08:36:58,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:36:58,591 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296767463]
[2023-10-26 08:36:58,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:58,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:36:58,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:59,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:36:59,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:36:59,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296767463]
[2023-10-26 08:36:59,212 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296767463] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:36:59,212 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819574541]
[2023-10-26 08:36:59,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:36:59,212 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:36:59,212 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:36:59,213 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:36:59,257 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-26 08:36:59,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:36:59,383 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core
[2023-10-26 08:36:59,386 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:36:59,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118
[2023-10-26 08:36:59,541 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:36:59,541 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:36:59,588 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:36:59,625 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:36:59,652 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:36:59,663 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:36:59,664 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:36:59,685 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:36:59,686 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:36:59,726 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:36:59,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:36:59,735 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:36:59,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819574541] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:36:59,735 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:36:59,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-10-26 08:36:59,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012804156]
[2023-10-26 08:36:59,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:36:59,737 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-26 08:36:59,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:36:59,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-26 08:36:59,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-10-26 08:37:00,177 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 223
[2023-10-26 08:37:00,178 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 535 transitions, 5508 flow. Second operand  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:00,178 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:00,178 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 223
[2023-10-26 08:37:00,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:08,009 INFO  L130       PetriNetUnfolder]: 25611/44258 cut-off events.
[2023-10-26 08:37:08,010 INFO  L131       PetriNetUnfolder]: For 222841/223413 co-relation queries the response was YES.
[2023-10-26 08:37:08,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 233478 conditions, 44258 events. 25611/44258 cut-off events. For 222841/223413 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 372009 event pairs, 3108 based on Foata normal form. 243/43813 useless extension candidates. Maximal degree in co-relation 233441. Up to 27629 conditions per place. 
[2023-10-26 08:37:08,392 INFO  L137   encePairwiseOnDemand]: 200/223 looper letters, 968 selfloop transitions, 231 changer transitions 3/1216 dead transitions.
[2023-10-26 08:37:08,392 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 1216 transitions, 14879 flow
[2023-10-26 08:37:08,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-26 08:37:08,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-26 08:37:08,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1171 transitions.
[2023-10-26 08:37:08,412 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4773746432939258
[2023-10-26 08:37:08,413 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1171 transitions.
[2023-10-26 08:37:08,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1171 transitions.
[2023-10-26 08:37:08,414 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:08,414 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1171 transitions.
[2023-10-26 08:37:08,416 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.45454545454545) internal successors, (1171), 11 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:08,420 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:08,421 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:08,421 INFO  L175             Difference]: Start difference. First operand has 123 places, 535 transitions, 5508 flow. Second operand 11 states and 1171 transitions.
[2023-10-26 08:37:08,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 1216 transitions, 14879 flow
[2023-10-26 08:37:14,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 1216 transitions, 14563 flow, removed 158 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:14,065 INFO  L231             Difference]: Finished difference. Result has 142 places, 776 transitions, 9317 flow
[2023-10-26 08:37:14,066 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=5318, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9317, PETRI_PLACES=142, PETRI_TRANSITIONS=776}
[2023-10-26 08:37:14,067 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 75 predicate places.
[2023-10-26 08:37:14,067 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 776 transitions, 9317 flow
[2023-10-26 08:37:14,068 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:14,068 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:14,068 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:14,074 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:14,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:14,273 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:37:14,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:14,274 INFO  L85        PathProgramCache]: Analyzing trace with hash -1315530165, now seen corresponding path program 2 times
[2023-10-26 08:37:14,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:14,275 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369450452]
[2023-10-26 08:37:14,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:14,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:14,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:15,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:15,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:15,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369450452]
[2023-10-26 08:37:15,079 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369450452] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:15,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134756277]
[2023-10-26 08:37:15,079 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:37:15,079 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:15,079 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:15,081 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:15,115 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-26 08:37:15,324 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:37:15,324 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:37:15,339 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-26 08:37:15,341 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:15,347 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-26 08:37:15,347 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2023-10-26 08:37:15,430 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:37:15,431 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:37:15,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:37:15,538 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:37:15,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:37:15,636 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:15,637 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:37:15,710 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:15,711 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:37:15,789 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:37:15,843 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:37:15,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:37:15,851 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:37:15,851 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134756277] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:15,851 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:37:15,851 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2023-10-26 08:37:15,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312693836]
[2023-10-26 08:37:15,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:15,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-26 08:37:15,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:15,854 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-26 08:37:15,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306
[2023-10-26 08:37:16,333 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-26 08:37:16,334 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 776 transitions, 9317 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:16,334 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:16,334 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-26 08:37:16,334 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:28,042 INFO  L130       PetriNetUnfolder]: 29386/50627 cut-off events.
[2023-10-26 08:37:28,042 INFO  L131       PetriNetUnfolder]: For 353311/353968 co-relation queries the response was YES.
[2023-10-26 08:37:28,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292679 conditions, 50627 events. 29386/50627 cut-off events. For 353311/353968 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 431721 event pairs, 4048 based on Foata normal form. 477/50824 useless extension candidates. Maximal degree in co-relation 292632. Up to 18515 conditions per place. 
[2023-10-26 08:37:28,509 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 1087 selfloop transitions, 522 changer transitions 35/1658 dead transitions.
[2023-10-26 08:37:28,509 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1658 transitions, 23195 flow
[2023-10-26 08:37:28,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-26 08:37:28,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-26 08:37:28,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1180 transitions.
[2023-10-26 08:37:28,522 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48104362005707296
[2023-10-26 08:37:28,522 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1180 transitions.
[2023-10-26 08:37:28,522 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1180 transitions.
[2023-10-26 08:37:28,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:28,528 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1180 transitions.
[2023-10-26 08:37:28,532 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.27272727272727) internal successors, (1180), 11 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,534 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,535 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,535 INFO  L175             Difference]: Start difference. First operand has 142 places, 776 transitions, 9317 flow. Second operand 11 states and 1180 transitions.
[2023-10-26 08:37:28,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1658 transitions, 23195 flow
[2023-10-26 08:37:33,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 1658 transitions, 23153 flow, removed 21 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:33,513 INFO  L231             Difference]: Finished difference. Result has 159 places, 1061 transitions, 15637 flow
[2023-10-26 08:37:33,514 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=9275, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15637, PETRI_PLACES=159, PETRI_TRANSITIONS=1061}
[2023-10-26 08:37:33,514 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 92 predicate places.
[2023-10-26 08:37:33,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 1061 transitions, 15637 flow
[2023-10-26 08:37:33,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:33,530 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:33,530 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:33,536 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:33,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-26 08:37:33,735 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:37:33,735 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:33,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -952832063, now seen corresponding path program 1 times
[2023-10-26 08:37:33,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:33,736 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287249829]
[2023-10-26 08:37:33,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:33,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:33,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:34,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:34,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:34,318 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287249829]
[2023-10-26 08:37:34,319 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287249829] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:34,319 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609698640]
[2023-10-26 08:37:34,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:34,319 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:34,319 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:34,334 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:34,371 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-26 08:37:34,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:34,492 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-26 08:37:34,495 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:34,517 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-26 08:37:34,517 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56
[2023-10-26 08:37:34,627 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:37:34,628 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:37:34,677 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:37:34,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:37:34,717 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:37:34,729 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:34,729 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:37:34,743 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:34,744 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:37:34,770 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:37:34,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:37:34,778 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:37:34,778 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [609698640] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:34,778 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:37:34,778 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-10-26 08:37:34,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009351223]
[2023-10-26 08:37:34,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:34,779 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-26 08:37:34,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:34,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-26 08:37:34,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-10-26 08:37:35,457 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 223
[2023-10-26 08:37:35,458 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1061 transitions, 15637 flow. Second operand  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:35,458 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:35,458 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 223
[2023-10-26 08:37:35,458 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:47,089 INFO  L130       PetriNetUnfolder]: 25293/45566 cut-off events.
[2023-10-26 08:37:47,090 INFO  L131       PetriNetUnfolder]: For 466512/469194 co-relation queries the response was YES.
[2023-10-26 08:37:47,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290394 conditions, 45566 events. 25293/45566 cut-off events. For 466512/469194 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 407756 event pairs, 1755 based on Foata normal form. 1039/45816 useless extension candidates. Maximal degree in co-relation 290339. Up to 17989 conditions per place. 
[2023-10-26 08:37:47,495 INFO  L137   encePairwiseOnDemand]: 212/223 looper letters, 1629 selfloop transitions, 83 changer transitions 0/1876 dead transitions.
[2023-10-26 08:37:47,495 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1876 transitions, 31384 flow
[2023-10-26 08:37:47,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-10-26 08:37:47,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-10-26 08:37:47,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions.
[2023-10-26 08:37:47,567 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5366218236173393
[2023-10-26 08:37:47,567 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions.
[2023-10-26 08:37:47,568 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions.
[2023-10-26 08:37:47,568 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:47,568 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions.
[2023-10-26 08:37:47,570 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,571 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,572 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,572 INFO  L175             Difference]: Start difference. First operand has 159 places, 1061 transitions, 15637 flow. Second operand 9 states and 1077 transitions.
[2023-10-26 08:37:47,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1876 transitions, 31384 flow
[2023-10-26 08:37:54,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1876 transitions, 31144 flow, removed 114 selfloop flow, removed 3 redundant places.
[2023-10-26 08:37:54,594 INFO  L231             Difference]: Finished difference. Result has 160 places, 1060 transitions, 15663 flow
[2023-10-26 08:37:54,595 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15497, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15663, PETRI_PLACES=160, PETRI_TRANSITIONS=1060}
[2023-10-26 08:37:54,600 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 93 predicate places.
[2023-10-26 08:37:54,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 1060 transitions, 15663 flow
[2023-10-26 08:37:54,610 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:54,610 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:54,610 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:54,616 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:54,814 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:54,815 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:37:54,816 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:54,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473696100, now seen corresponding path program 1 times
[2023-10-26 08:37:54,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:54,817 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272517421]
[2023-10-26 08:37:54,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:54,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:54,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:54,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:54,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:54,938 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272517421]
[2023-10-26 08:37:54,939 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272517421] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:54,939 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312572779]
[2023-10-26 08:37:54,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:54,939 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:54,939 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:54,951 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:54,988 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-26 08:37:55,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:55,134 INFO  L263         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:37:55,137 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:55,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:55,181 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:55,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:55,212 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312572779] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:55,212 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:55,212 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-26 08:37:55,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703900254]
[2023-10-26 08:37:55,213 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:55,213 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:37:55,213 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:55,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:37:55,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:37:55,356 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2023-10-26 08:37:55,357 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 1060 transitions, 15663 flow. Second operand  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:55,357 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:55,357 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2023-10-26 08:37:55,357 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:02,240 INFO  L130       PetriNetUnfolder]: 15396/31719 cut-off events.
[2023-10-26 08:38:02,240 INFO  L131       PetriNetUnfolder]: For 305768/309415 co-relation queries the response was YES.
[2023-10-26 08:38:02,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193046 conditions, 31719 events. 15396/31719 cut-off events. For 305768/309415 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 305458 event pairs, 668 based on Foata normal form. 629/31810 useless extension candidates. Maximal degree in co-relation 192993. Up to 13355 conditions per place. 
[2023-10-26 08:38:02,609 INFO  L137   encePairwiseOnDemand]: 216/223 looper letters, 356 selfloop transitions, 7 changer transitions 31/1129 dead transitions.
[2023-10-26 08:38:02,609 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1129 transitions, 17228 flow
[2023-10-26 08:38:02,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-26 08:38:02,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-26 08:38:02,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions.
[2023-10-26 08:38:02,625 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667040358744395
[2023-10-26 08:38:02,629 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions.
[2023-10-26 08:38:02,629 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions.
[2023-10-26 08:38:02,630 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:02,630 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions.
[2023-10-26 08:38:02,631 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:02,633 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:02,634 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:02,634 INFO  L175             Difference]: Start difference. First operand has 160 places, 1060 transitions, 15663 flow. Second operand 8 states and 1011 transitions.
[2023-10-26 08:38:02,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1129 transitions, 17228 flow
[2023-10-26 08:38:05,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1129 transitions, 17054 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-10-26 08:38:05,592 INFO  L231             Difference]: Finished difference. Result has 163 places, 1017 transitions, 15096 flow
[2023-10-26 08:38:05,593 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15177, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15096, PETRI_PLACES=163, PETRI_TRANSITIONS=1017}
[2023-10-26 08:38:05,593 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-10-26 08:38:05,593 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 1017 transitions, 15096 flow
[2023-10-26 08:38:05,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:05,594 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:38:05,594 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:38:05,600 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-26 08:38:05,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-26 08:38:05,799 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:38:05,800 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:38:05,800 INFO  L85        PathProgramCache]: Analyzing trace with hash -985146553, now seen corresponding path program 3 times
[2023-10-26 08:38:05,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:38:05,801 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367086051]
[2023-10-26 08:38:05,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:05,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:38:05,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:06,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:06,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:38:06,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367086051]
[2023-10-26 08:38:06,608 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367086051] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:38:06,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886587942]
[2023-10-26 08:38:06,608 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:38:06,608 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:06,608 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:38:06,609 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:38:06,653 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-26 08:38:06,803 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:38:06,804 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:38:06,805 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core
[2023-10-26 08:38:06,808 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:38:06,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-26 08:38:06,939 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:38:06,940 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-26 08:38:06,987 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:38:07,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:38:07,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:38:07,115 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:07,115 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:38:07,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:38:07,263 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:38:07,299 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:07,299 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:38:07,360 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:07,392 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:07,429 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:07,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:07,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:07,489 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:38:07,489 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [886587942] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:38:07,489 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:38:07,489 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-26 08:38:07,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198461532]
[2023-10-26 08:38:07,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:38:07,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-26 08:38:07,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:38:07,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-26 08:38:07,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-10-26 08:38:08,234 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-26 08:38:08,235 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 1017 transitions, 15096 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:08,235 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:38:08,235 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-26 08:38:08,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:21,342 INFO  L130       PetriNetUnfolder]: 26004/45151 cut-off events.
[2023-10-26 08:38:21,343 INFO  L131       PetriNetUnfolder]: For 444696/445207 co-relation queries the response was YES.
[2023-10-26 08:38:21,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289287 conditions, 45151 events. 26004/45151 cut-off events. For 444696/445207 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 376100 event pairs, 3055 based on Foata normal form. 404/45231 useless extension candidates. Maximal degree in co-relation 289230. Up to 23580 conditions per place. 
[2023-10-26 08:38:21,757 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1030 selfloop transitions, 602 changer transitions 38/1682 dead transitions.
[2023-10-26 08:38:21,757 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1682 transitions, 26046 flow
[2023-10-26 08:38:21,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-10-26 08:38:21,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-10-26 08:38:21,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1660 transitions.
[2023-10-26 08:38:21,775 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4962630792227205
[2023-10-26 08:38:21,777 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1660 transitions.
[2023-10-26 08:38:21,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1660 transitions.
[2023-10-26 08:38:21,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:21,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1660 transitions.
[2023-10-26 08:38:21,782 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.66666666666667) internal successors, (1660), 15 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:21,785 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:21,794 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:21,794 INFO  L175             Difference]: Start difference. First operand has 163 places, 1017 transitions, 15096 flow. Second operand 15 states and 1660 transitions.
[2023-10-26 08:38:21,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 1682 transitions, 26046 flow
[2023-10-26 08:38:26,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1682 transitions, 25696 flow, removed 50 selfloop flow, removed 3 redundant places.
[2023-10-26 08:38:26,113 INFO  L231             Difference]: Finished difference. Result has 179 places, 1268 transitions, 20571 flow
[2023-10-26 08:38:26,114 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=14897, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20571, PETRI_PLACES=179, PETRI_TRANSITIONS=1268}
[2023-10-26 08:38:26,115 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 112 predicate places.
[2023-10-26 08:38:26,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 1268 transitions, 20571 flow
[2023-10-26 08:38:26,116 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:26,116 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:38:26,116 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:38:26,123 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-26 08:38:26,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:26,322 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:38:26,322 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:38:26,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 541897883, now seen corresponding path program 4 times
[2023-10-26 08:38:26,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:38:26,323 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215198365]
[2023-10-26 08:38:26,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:26,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:38:26,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:27,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:27,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:38:27,124 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215198365]
[2023-10-26 08:38:27,124 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215198365] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:38:27,124 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384736953]
[2023-10-26 08:38:27,124 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-26 08:38:27,124 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:27,124 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:38:27,126 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:38:27,169 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-26 08:38:27,470 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-26 08:38:27,470 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:38:27,472 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-26 08:38:27,478 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:38:27,484 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-26 08:38:27,597 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:38:27,598 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-26 08:38:27,659 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:38:27,669 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:38:27,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:38:27,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:38:27,822 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:27,822 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:38:27,881 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:27,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:38:27,964 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:27,981 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:28,021 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:28,052 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:28,099 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:28,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:38:28,117 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:38:28,117 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384736953] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:38:28,117 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:38:28,117 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-26 08:38:28,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357589924]
[2023-10-26 08:38:28,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:38:28,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-26 08:38:28,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:38:28,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-26 08:38:28,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2023-10-26 08:38:28,781 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-26 08:38:28,782 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1268 transitions, 20571 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:28,782 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:38:28,782 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-26 08:38:28,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:44,584 INFO  L130       PetriNetUnfolder]: 28505/49623 cut-off events.
[2023-10-26 08:38:44,584 INFO  L131       PetriNetUnfolder]: For 612494/613077 co-relation queries the response was YES.
[2023-10-26 08:38:44,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 345311 conditions, 49623 events. 28505/49623 cut-off events. For 612494/613077 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 419890 event pairs, 3217 based on Foata normal form. 356/49614 useless extension candidates. Maximal degree in co-relation 345249. Up to 23695 conditions per place. 
[2023-10-26 08:38:45,106 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1364 selfloop transitions, 532 changer transitions 35/1943 dead transitions.
[2023-10-26 08:38:45,107 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1943 transitions, 33856 flow
[2023-10-26 08:38:45,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-26 08:38:45,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-26 08:38:45,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions.
[2023-10-26 08:38:45,109 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48654708520179374
[2023-10-26 08:38:45,109 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions.
[2023-10-26 08:38:45,109 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions.
[2023-10-26 08:38:45,110 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:45,110 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions.
[2023-10-26 08:38:45,113 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:45,127 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:45,141 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:45,142 INFO  L175             Difference]: Start difference. First operand has 179 places, 1268 transitions, 20571 flow. Second operand 12 states and 1302 transitions.
[2023-10-26 08:38:45,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1943 transitions, 33856 flow
[2023-10-26 08:38:57,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1943 transitions, 33063 flow, removed 388 selfloop flow, removed 2 redundant places.
[2023-10-26 08:38:57,632 INFO  L231             Difference]: Finished difference. Result has 194 places, 1519 transitions, 26205 flow
[2023-10-26 08:38:57,633 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=19795, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26205, PETRI_PLACES=194, PETRI_TRANSITIONS=1519}
[2023-10-26 08:38:57,633 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 127 predicate places.
[2023-10-26 08:38:57,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 1519 transitions, 26205 flow
[2023-10-26 08:38:57,634 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:57,634 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:38:57,635 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:38:57,641 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-26 08:38:57,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:57,840 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:38:57,840 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:38:57,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331203745, now seen corresponding path program 5 times
[2023-10-26 08:38:57,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:38:57,841 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208186712]
[2023-10-26 08:38:57,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:57,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:38:57,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:58,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:58,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:38:58,592 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208186712]
[2023-10-26 08:38:58,592 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208186712] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:38:58,592 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773868154]
[2023-10-26 08:38:58,592 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-26 08:38:58,592 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:58,592 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:38:58,593 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:38:58,627 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-26 08:38:58,783 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:38:58,783 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:38:58,798 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-26 08:38:58,801 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:38:58,810 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:58,815 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-10-26 08:38:58,929 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:38:58,930 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:38:59,002 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:59,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:38:59,012 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:38:59,066 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:38:59,120 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:38:59,161 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:59,161 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:38:59,219 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:59,221 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:38:59,261 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:59,263 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:38:59,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:59,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:38:59,354 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:59,355 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:38:59,393 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:59,394 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:38:59,422 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:38:59,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:38:59,439 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:38:59,439 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [773868154] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:38:59,439 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-26 08:38:59,439 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2023-10-26 08:38:59,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387173640]
[2023-10-26 08:38:59,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:38:59,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-26 08:38:59,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:38:59,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-26 08:38:59,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306
[2023-10-26 08:39:00,207 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-10-26 08:39:00,208 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1519 transitions, 26205 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:00,208 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:00,208 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-10-26 08:39:00,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:39:18,899 INFO  L130       PetriNetUnfolder]: 29302/51201 cut-off events.
[2023-10-26 08:39:18,900 INFO  L131       PetriNetUnfolder]: For 792739/793363 co-relation queries the response was YES.
[2023-10-26 08:39:19,262 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 380440 conditions, 51201 events. 29302/51201 cut-off events. For 792739/793363 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 436333 event pairs, 3287 based on Foata normal form. 454/51290 useless extension candidates. Maximal degree in co-relation 380372. Up to 26464 conditions per place. 
[2023-10-26 08:39:19,613 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1356 selfloop transitions, 638 changer transitions 30/2036 dead transitions.
[2023-10-26 08:39:19,614 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 2036 transitions, 37326 flow
[2023-10-26 08:39:19,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-10-26 08:39:19,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-10-26 08:39:19,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1419 transitions.
[2023-10-26 08:39:19,617 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4894791307347361
[2023-10-26 08:39:19,617 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1419 transitions.
[2023-10-26 08:39:19,617 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1419 transitions.
[2023-10-26 08:39:19,617 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:39:19,617 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1419 transitions.
[2023-10-26 08:39:19,619 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 109.15384615384616) internal successors, (1419), 13 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:19,621 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:19,621 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:19,621 INFO  L175             Difference]: Start difference. First operand has 194 places, 1519 transitions, 26205 flow. Second operand 13 states and 1419 transitions.
[2023-10-26 08:39:19,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 2036 transitions, 37326 flow
[2023-10-26 08:39:34,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 2036 transitions, 36322 flow, removed 433 selfloop flow, removed 5 redundant places.
[2023-10-26 08:39:34,834 INFO  L231             Difference]: Finished difference. Result has 206 places, 1644 transitions, 29953 flow
[2023-10-26 08:39:34,835 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=25312, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=29953, PETRI_PLACES=206, PETRI_TRANSITIONS=1644}
[2023-10-26 08:39:34,835 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 139 predicate places.
[2023-10-26 08:39:34,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 1644 transitions, 29953 flow
[2023-10-26 08:39:34,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:34,836 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:34,836 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:39:34,843 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-26 08:39:35,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-26 08:39:35,041 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-26 08:39:35,042 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:35,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -1301331673, now seen corresponding path program 1 times
[2023-10-26 08:39:35,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:35,053 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823504774]
[2023-10-26 08:39:35,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:35,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:35,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:39:35,101 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:39:35,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:39:35,140 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:39:35,140 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:39:35,140 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-10-26 08:39:35,140 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-10-26 08:39:35,140 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-10-26 08:39:35,141 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-10-26 08:39:35,142 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-10-26 08:39:35,142 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-10-26 08:39:35,142 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-10-26 08:39:35,142 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-26 08:39:35,142 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:39:35,143 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:39:35,143 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-26 08:39:35,181 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-26 08:39:35,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2023-10-26 08:39:35,228 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2023-10-26 08:39:35,237 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-26 08:39:35,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2023-10-26 08:39:35,238 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 158 transitions, 346 flow
[2023-10-26 08:39:35,253 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 346 flow
[2023-10-26 08:39:35,253 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:39:35,253 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 158 transitions, 346 flow
[2023-10-26 08:39:35,255 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 158 transitions, 346 flow
[2023-10-26 08:39:35,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2023-10-26 08:39:35,298 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2023-10-26 08:39:35,299 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-26 08:39:35,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2023-10-26 08:39:35,310 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9576
[2023-10-26 08:39:37,863 INFO  L134        LiptonReduction]: Checked pairs total: 53700
[2023-10-26 08:39:37,863 INFO  L136        LiptonReduction]: Total number of compositions: 94
[2023-10-26 08:39:37,864 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:39:37,864 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dca86f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:39:37,864 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-26 08:39:37,865 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-26 08:39:37,865 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:39:37,865 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:37,865 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-26 08:39:37,865 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 08:39:37,865 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:37,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times
[2023-10-26 08:39:37,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:37,865 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240798316]
[2023-10-26 08:39:37,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:37,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:37,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:37,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:37,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:39:37,868 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240798316]
[2023-10-26 08:39:37,868 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240798316] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:39:37,868 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:39:37,868 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-26 08:39:37,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679506701]
[2023-10-26 08:39:37,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:39:37,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:39:37,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:39:37,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:39:37,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:39:37,881 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 252
[2023-10-26 08:39:37,882 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:37,882 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:37,882 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 252
[2023-10-26 08:39:37,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:39:38,876 INFO  L130       PetriNetUnfolder]: 3248/7585 cut-off events.
[2023-10-26 08:39:38,889 INFO  L131       PetriNetUnfolder]: For 647/1494 co-relation queries the response was YES.
[2023-10-26 08:39:38,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12704 conditions, 7585 events. 3248/7585 cut-off events. For 647/1494 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 64204 event pairs, 3205 based on Foata normal form. 0/6863 useless extension candidates. Maximal degree in co-relation 10479. Up to 4887 conditions per place. 
[2023-10-26 08:39:38,930 INFO  L137   encePairwiseOnDemand]: 251/252 looper letters, 27 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-10-26 08:39:38,930 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 234 flow
[2023-10-26 08:39:38,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:39:38,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:39:38,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions.
[2023-10-26 08:39:38,931 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6468253968253969
[2023-10-26 08:39:38,931 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 326 transitions.
[2023-10-26 08:39:38,931 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 326 transitions.
[2023-10-26 08:39:38,932 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:39:38,932 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 326 transitions.
[2023-10-26 08:39:38,932 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:38,933 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:38,933 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:38,933 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 326 transitions.
[2023-10-26 08:39:38,933 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 234 flow
[2023-10-26 08:39:38,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:39:38,935 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-10-26 08:39:38,935 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2023-10-26 08:39:38,935 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-10-26 08:39:38,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-10-26 08:39:38,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:38,936 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:38,936 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:39:38,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-26 08:39:38,936 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 08:39:38,942 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:38,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -164949161, now seen corresponding path program 1 times
[2023-10-26 08:39:38,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:38,943 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453549247]
[2023-10-26 08:39:38,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:38,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:38,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:39,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:39,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:39:39,091 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453549247]
[2023-10-26 08:39:39,092 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453549247] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:39:39,092 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:39:39,092 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:39:39,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561330047]
[2023-10-26 08:39:39,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:39:39,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:39:39,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:39:39,093 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:39:39,093 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:39:39,370 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 252
[2023-10-26 08:39:39,371 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:39,371 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:39,371 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 252
[2023-10-26 08:39:39,371 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:39:48,887 INFO  L130       PetriNetUnfolder]: 72405/116612 cut-off events.
[2023-10-26 08:39:48,888 INFO  L131       PetriNetUnfolder]: For 3734/4224 co-relation queries the response was YES.
[2023-10-26 08:39:49,061 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222409 conditions, 116612 events. 72405/116612 cut-off events. For 3734/4224 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 983482 event pairs, 18294 based on Foata normal form. 157/112065 useless extension candidates. Maximal degree in co-relation 222403. Up to 69950 conditions per place. 
[2023-10-26 08:39:49,419 INFO  L137   encePairwiseOnDemand]: 221/252 looper letters, 109 selfloop transitions, 64 changer transitions 0/195 dead transitions.
[2023-10-26 08:39:49,420 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 787 flow
[2023-10-26 08:39:49,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:39:49,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:39:49,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions.
[2023-10-26 08:39:49,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5767195767195767
[2023-10-26 08:39:49,421 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 872 transitions.
[2023-10-26 08:39:49,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 872 transitions.
[2023-10-26 08:39:49,421 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:39:49,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 872 transitions.
[2023-10-26 08:39:49,422 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:49,424 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:49,424 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:49,424 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 872 transitions.
[2023-10-26 08:39:49,424 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 787 flow
[2023-10-26 08:39:49,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 195 transitions, 787 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:39:49,432 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-10-26 08:39:49,433 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2023-10-26 08:39:49,433 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-10-26 08:39:49,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-10-26 08:39:49,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:49,433 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:49,434 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:39:49,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-26 08:39:49,434 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 08:39:49,434 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:49,434 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831077822, now seen corresponding path program 1 times
[2023-10-26 08:39:49,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:49,435 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944361648]
[2023-10-26 08:39:49,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:49,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:49,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:49,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:49,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:39:49,472 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944361648]
[2023-10-26 08:39:49,472 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944361648] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:39:49,472 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:39:49,472 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:39:49,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776245069]
[2023-10-26 08:39:49,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:39:49,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:39:49,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:39:49,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:39:49,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:39:49,500 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 252
[2023-10-26 08:39:49,500 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:49,500 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:49,500 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 252
[2023-10-26 08:39:49,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:39:50,173 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2023-10-26 08:39:50,173 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,173 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,173 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,173 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,174 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2023-10-26 08:39:50,174 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,174 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,174 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:39:50,174 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-26 08:39:53,065 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,066 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,066 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,067 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 139#L1017-1true, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,067 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,068 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-26 08:39:53,320 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,321 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,322 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,322 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,323 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,323 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,324 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,324 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 139#L1017-1true, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,325 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,325 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,325 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,325 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-26 08:39:53,769 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,769 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,769 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,769 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,771 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,771 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,772 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,772 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-26 08:39:53,974 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-10-26 08:39:53,975 INFO  L383   tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event
[2023-10-26 08:39:53,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 08:39:53,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 08:39:53,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-26 08:39:55,762 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 36#L1029-1true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2023-10-26 08:39:55,762 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,763 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 100#L1031true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2023-10-26 08:39:55,763 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-26 08:39:55,763 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-26 08:39:56,128 INFO  L130       PetriNetUnfolder]: 39413/75193 cut-off events.
[2023-10-26 08:39:56,128 INFO  L131       PetriNetUnfolder]: For 40753/48755 co-relation queries the response was YES.
[2023-10-26 08:39:56,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 180406 conditions, 75193 events. 39413/75193 cut-off events. For 40753/48755 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 755451 event pairs, 17234 based on Foata normal form. 1078/70433 useless extension candidates. Maximal degree in co-relation 180395. Up to 34821 conditions per place. 
[2023-10-26 08:39:56,576 INFO  L137   encePairwiseOnDemand]: 244/252 looper letters, 51 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-10-26 08:39:56,576 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 766 flow
[2023-10-26 08:39:56,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:39:56,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:39:56,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions.
[2023-10-26 08:39:56,578 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5992063492063492
[2023-10-26 08:39:56,578 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 453 transitions.
[2023-10-26 08:39:56,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions.
[2023-10-26 08:39:56,578 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:39:56,578 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions.
[2023-10-26 08:39:56,579 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:56,579 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:56,580 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:56,580 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 453 transitions.
[2023-10-26 08:39:56,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 766 flow
[2023-10-26 08:39:57,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 766 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:39:57,398 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-10-26 08:39:57,405 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2023-10-26 08:39:57,406 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-10-26 08:39:57,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-10-26 08:39:57,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:57,407 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:57,407 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:39:57,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-26 08:39:57,407 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 08:39:57,407 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:57,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -214994823, now seen corresponding path program 1 times
[2023-10-26 08:39:57,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:57,408 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438718391]
[2023-10-26 08:39:57,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:57,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:57,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:57,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:57,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:39:57,713 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438718391]
[2023-10-26 08:39:57,713 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438718391] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:39:57,713 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:39:57,713 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:39:57,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021842051]
[2023-10-26 08:39:57,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:39:57,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:39:57,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:39:57,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:39:57,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:39:57,969 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 252
[2023-10-26 08:39:57,969 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:57,969 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:57,969 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 252
[2023-10-26 08:39:57,969 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:40:10,042 INFO  L130       PetriNetUnfolder]: 77040/122336 cut-off events.
[2023-10-26 08:40:10,042 INFO  L131       PetriNetUnfolder]: For 92792/93950 co-relation queries the response was YES.
[2023-10-26 08:40:10,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 335803 conditions, 122336 events. 77040/122336 cut-off events. For 92792/93950 co-relation queries the response was YES. Maximal size of possible extension queue 2947. Compared 1014085 event pairs, 25862 based on Foata normal form. 0/116443 useless extension candidates. Maximal degree in co-relation 335791. Up to 86387 conditions per place. 
[2023-10-26 08:40:10,999 INFO  L137   encePairwiseOnDemand]: 233/252 looper letters, 146 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-10-26 08:40:11,000 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1803 flow
[2023-10-26 08:40:11,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:40:11,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:40:11,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions.
[2023-10-26 08:40:11,001 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58994708994709
[2023-10-26 08:40:11,001 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 892 transitions.
[2023-10-26 08:40:11,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions.
[2023-10-26 08:40:11,002 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:40:11,002 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions.
[2023-10-26 08:40:11,003 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:11,004 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:11,004 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:11,004 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 892 transitions.
[2023-10-26 08:40:11,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1803 flow
[2023-10-26 08:40:11,179 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1803 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:40:11,182 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-10-26 08:40:11,182 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2023-10-26 08:40:11,182 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-10-26 08:40:11,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-10-26 08:40:11,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:11,183 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:40:11,183 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:40:11,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-26 08:40:11,183 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 08:40:11,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:40:11,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 135492018, now seen corresponding path program 1 times
[2023-10-26 08:40:11,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:40:11,184 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037769066]
[2023-10-26 08:40:11,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:40:11,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:40:11,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:40:11,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:40:11,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:40:11,405 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037769066]
[2023-10-26 08:40:11,405 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037769066] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:40:11,405 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:40:11,405 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:40:11,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818640398]
[2023-10-26 08:40:11,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:40:11,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:40:11,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:40:11,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:40:11,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:40:11,628 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252
[2023-10-26 08:40:11,628 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:11,628 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:40:11,628 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252
[2023-10-26 08:40:11,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:40:42,304 INFO  L130       PetriNetUnfolder]: 162624/249129 cut-off events.
[2023-10-26 08:40:42,305 INFO  L131       PetriNetUnfolder]: For 278364/281003 co-relation queries the response was YES.
[2023-10-26 08:40:43,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 804273 conditions, 249129 events. 162624/249129 cut-off events. For 278364/281003 co-relation queries the response was YES. Maximal size of possible extension queue 5466. Compared 2101517 event pairs, 45865 based on Foata normal form. 0/234625 useless extension candidates. Maximal degree in co-relation 804256. Up to 163056 conditions per place. 
[2023-10-26 08:40:44,596 INFO  L137   encePairwiseOnDemand]: 222/252 looper letters, 328 selfloop transitions, 162 changer transitions 0/513 dead transitions.
[2023-10-26 08:40:44,597 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 513 transitions, 4050 flow
[2023-10-26 08:40:44,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:40:44,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:40:44,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 913 transitions.
[2023-10-26 08:40:44,598 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6038359788359788
[2023-10-26 08:40:44,598 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 913 transitions.
[2023-10-26 08:40:44,598 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 913 transitions.
[2023-10-26 08:40:44,599 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:40:44,599 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 913 transitions.
[2023-10-26 08:40:44,600 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:44,601 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:44,601 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:44,601 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 913 transitions.
[2023-10-26 08:40:44,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 513 transitions, 4050 flow
[2023-10-26 08:40:47,093 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 513 transitions, 4050 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:40:47,097 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-10-26 08:40:47,097 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2023-10-26 08:40:47,098 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-10-26 08:40:47,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-10-26 08:40:47,098 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:47,098 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:40:47,098 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:40:47,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-10-26 08:40:47,099 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-26 08:40:47,100 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:40:47,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -728071784, now seen corresponding path program 1 times
[2023-10-26 08:40:47,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:40:47,100 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756638788]
[2023-10-26 08:40:47,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:40:47,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:40:47,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:40:47,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:40:47,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:40:47,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756638788]
[2023-10-26 08:40:47,423 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756638788] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:40:47,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649040501]
[2023-10-26 08:40:47,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:40:47,423 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:40:47,424 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:40:47,426 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:40:47,450 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-26 08:40:47,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:40:47,715 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-26 08:40:47,721 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:40:47,784 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:40:47,811 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,812 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:40:47,844 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,845 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,845 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:40:47,886 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,887 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:40:47,945 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:40:47,948 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:40:47,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:40:47,970 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:40:47,997 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-10-26 08:40:48,053 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2023-10-26 08:40:48,083 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-10-26 08:40:48,098 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-10-26 08:40:48,115 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:40:48,115 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-26 08:40:48,134 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:40:48,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-26 08:40:48,137 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-26 08:40:48,146 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:40:48,146 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:40:48,150 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:40:48,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:40:48,153 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:40:48,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:40:48,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2023-10-26 08:40:48,179 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [649040501] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:40:48,179 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:40:48,179 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-10-26 08:40:48,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202474222]
[2023-10-26 08:40:48,179 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:40:48,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-10-26 08:40:48,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:40:48,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-10-26 08:40:48,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2023-10-26 08:40:48,221 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 252
[2023-10-26 08:40:48,222 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:48,222 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:40:48,222 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 252
[2023-10-26 08:40:48,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
