./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --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 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:21:32,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:21:33,026 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 17:21:33,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:21:33,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:21:33,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:21:33,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:21:33,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:21:33,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:21:33,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:21:33,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:21:33,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:21:33,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:21:33,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:21:33,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:21:33,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:21:33,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:21:33,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:21:33,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:21:33,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:21:33,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:21:33,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:21:33,086 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 17:21:33,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:21:33,087 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:21:33,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:21:33,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:21:33,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:21:33,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:21:33,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:21:33,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:21:33,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:21:33,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:21:33,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:21:33,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:21:33,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:21:33,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:21:33,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:21:33,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:21:33,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:21:33,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:21:33,094 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e [2024-11-08 17:21:33,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:21:33,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:21:33,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:21:33,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:21:33,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:21:33,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i Unable to find full path for "g++" [2024-11-08 17:21:35,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:21:35,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:21:35,765 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2024-11-08 17:21:35,787 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/data/d4e074313/efbbe83ca76f4756b8ab06dbfef80ec2/FLAG0f8261aec [2024-11-08 17:21:35,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/data/d4e074313/efbbe83ca76f4756b8ab06dbfef80ec2 [2024-11-08 17:21:35,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:21:35,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:21:35,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:21:35,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:21:35,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:21:35,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:21:35" (1/1) ... [2024-11-08 17:21:35,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398b12a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:35, skipping insertion in model container [2024-11-08 17:21:35,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:21:35" (1/1) ... [2024-11-08 17:21:35,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:21:36,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:21:36,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:21:36,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:21:36,640 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:21:36,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36 WrapperNode [2024-11-08 17:21:36,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:21:36,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:21:36,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:21:36,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:21:36,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,692 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-08 17:21:36,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:21:36,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:21:36,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:21:36,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:21:36,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:21:36,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:21:36,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:21:36,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:21:36,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (1/1) ... [2024-11-08 17:21:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:21:36,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:21:36,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:21:36,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:21:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:21:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 17:21:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 17:21:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:21:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-08 17:21:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-08 17:21:36,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:21:36,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:21:36,806 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 17:21:36,963 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:21:36,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:21:37,216 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 17:21:37,216 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:21:37,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:21:37,241 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 17:21:37,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:21:37 BoogieIcfgContainer [2024-11-08 17:21:37,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:21:37,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:21:37,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:21:37,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:21:37,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:21:35" (1/3) ... [2024-11-08 17:21:37,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a03432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:21:37, skipping insertion in model container [2024-11-08 17:21:37,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:21:36" (2/3) ... [2024-11-08 17:21:37,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a03432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:21:37, skipping insertion in model container [2024-11-08 17:21:37,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:21:37" (3/3) ... [2024-11-08 17:21:37,255 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i [2024-11-08 17:21:37,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:21:37,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-08 17:21:37,276 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 17:21:37,390 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 17:21:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 99 transitions, 205 flow [2024-11-08 17:21:37,493 INFO L124 PetriNetUnfolderBase]: 6/136 cut-off events. [2024-11-08 17:21:37,493 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 17:21:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 136 events. 6/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 245 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2024-11-08 17:21:37,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 99 transitions, 205 flow [2024-11-08 17:21:37,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 99 transitions, 205 flow [2024-11-08 17:21:37,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:21:37,522 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1b6009d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:21:37,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-08 17:21:37,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 17:21:37,531 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-08 17:21:37,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 17:21:37,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:37,532 INFO L204 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] [2024-11-08 17:21:37,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:37,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 166954326, now seen corresponding path program 1 times [2024-11-08 17:21:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151742173] [2024-11-08 17:21:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151742173] [2024-11-08 17:21:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151742173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:21:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354101886] [2024-11-08 17:21:37,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:37,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:21:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:21:37,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:21:37,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2024-11-08 17:21:37,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2024-11-08 17:21:37,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:37,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2024-11-08 17:21:37,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:37,964 INFO L124 PetriNetUnfolderBase]: 7/170 cut-off events. [2024-11-08 17:21:37,964 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 17:21:37,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 170 events. 7/170 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 349 event pairs, 2 based on Foata normal form. 1/149 useless extension candidates. Maximal degree in co-relation 106. Up to 15 conditions per place. [2024-11-08 17:21:37,967 INFO L140 encePairwiseOnDemand]: 95/99 looper letters, 8 selfloop transitions, 2 changer transitions 1/97 dead transitions. [2024-11-08 17:21:37,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 221 flow [2024-11-08 17:21:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:21:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:21:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2024-11-08 17:21:37,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2024-11-08 17:21:37,984 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 205 flow. Second operand 3 states and 273 transitions. [2024-11-08 17:21:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 221 flow [2024-11-08 17:21:37,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:37,995 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 203 flow [2024-11-08 17:21:37,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-11-08 17:21:38,001 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2024-11-08 17:21:38,001 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 203 flow [2024-11-08 17:21:38,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2024-11-08 17:21:38,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:38,002 INFO L204 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, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:38,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:21:38,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:38,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 672023371, now seen corresponding path program 1 times [2024-11-08 17:21:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:38,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556790383] [2024-11-08 17:21:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556790383] [2024-11-08 17:21:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556790383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:21:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226083079] [2024-11-08 17:21:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:38,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:21:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:21:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:21:38,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 99 [2024-11-08 17:21:38,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2024-11-08 17:21:38,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:38,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 99 [2024-11-08 17:21:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:38,286 INFO L124 PetriNetUnfolderBase]: 10/180 cut-off events. [2024-11-08 17:21:38,286 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-08 17:21:38,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 180 events. 10/180 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 354 event pairs, 2 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. [2024-11-08 17:21:38,288 INFO L140 encePairwiseOnDemand]: 95/99 looper letters, 7 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-11-08 17:21:38,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 221 flow [2024-11-08 17:21:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:21:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:21:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-08 17:21:38,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.936026936026936 [2024-11-08 17:21:38,293 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 203 flow. Second operand 3 states and 278 transitions. [2024-11-08 17:21:38,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 221 flow [2024-11-08 17:21:38,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 17:21:38,299 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 209 flow [2024-11-08 17:21:38,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2024-11-08 17:21:38,300 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2024-11-08 17:21:38,300 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 209 flow [2024-11-08 17:21:38,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2024-11-08 17:21:38,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:38,302 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:38,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:21:38,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1611712341, now seen corresponding path program 1 times [2024-11-08 17:21:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965484445] [2024-11-08 17:21:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:38,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965484445] [2024-11-08 17:21:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965484445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815043119] [2024-11-08 17:21:38,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:38,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:21:38,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:38,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:21:38,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:21:38,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 99 [2024-11-08 17:21:38,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 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) [2024-11-08 17:21:38,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:38,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 99 [2024-11-08 17:21:38,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:38,822 INFO L124 PetriNetUnfolderBase]: 6/156 cut-off events. [2024-11-08 17:21:38,823 INFO L125 PetriNetUnfolderBase]: For 11/18 co-relation queries the response was YES. [2024-11-08 17:21:38,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 156 events. 6/156 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 104. Up to 19 conditions per place. [2024-11-08 17:21:38,824 INFO L140 encePairwiseOnDemand]: 90/99 looper letters, 13 selfloop transitions, 2 changer transitions 6/102 dead transitions. [2024-11-08 17:21:38,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 263 flow [2024-11-08 17:21:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2024-11-08 17:21:38,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8754208754208754 [2024-11-08 17:21:38,831 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 209 flow. Second operand 6 states and 520 transitions. [2024-11-08 17:21:38,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 263 flow [2024-11-08 17:21:38,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:38,837 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 229 flow [2024-11-08 17:21:38,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2024-11-08 17:21:38,841 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-11-08 17:21:38,841 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 229 flow [2024-11-08 17:21:38,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 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) [2024-11-08 17:21:38,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:38,842 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:38,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:21:38,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:38,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:38,844 INFO L85 PathProgramCache]: Analyzing trace with hash -566561988, now seen corresponding path program 1 times [2024-11-08 17:21:38,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453394210] [2024-11-08 17:21:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453394210] [2024-11-08 17:21:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453394210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:39,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:39,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:39,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635481438] [2024-11-08 17:21:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:39,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:21:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:21:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:21:39,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2024-11-08 17:21:39,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 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) [2024-11-08 17:21:39,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2024-11-08 17:21:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:39,798 INFO L124 PetriNetUnfolderBase]: 76/382 cut-off events. [2024-11-08 17:21:39,798 INFO L125 PetriNetUnfolderBase]: For 26/29 co-relation queries the response was YES. [2024-11-08 17:21:39,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 382 events. 76/382 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1783 event pairs, 35 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 543. Up to 151 conditions per place. [2024-11-08 17:21:39,802 INFO L140 encePairwiseOnDemand]: 88/99 looper letters, 23 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2024-11-08 17:21:39,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 117 transitions, 361 flow [2024-11-08 17:21:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 490 transitions. [2024-11-08 17:21:39,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8249158249158249 [2024-11-08 17:21:39,807 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 229 flow. Second operand 6 states and 490 transitions. [2024-11-08 17:21:39,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 117 transitions, 361 flow [2024-11-08 17:21:39,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 117 transitions, 347 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-08 17:21:39,814 INFO L231 Difference]: Finished difference. Result has 108 places, 117 transitions, 365 flow [2024-11-08 17:21:39,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=108, PETRI_TRANSITIONS=117} [2024-11-08 17:21:39,815 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 10 predicate places. [2024-11-08 17:21:39,816 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 117 transitions, 365 flow [2024-11-08 17:21:39,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 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) [2024-11-08 17:21:39,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:39,818 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:39,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:21:39,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1595896121, now seen corresponding path program 1 times [2024-11-08 17:21:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798460773] [2024-11-08 17:21:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798460773] [2024-11-08 17:21:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798460773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:40,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912981917] [2024-11-08 17:21:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:40,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:21:40,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:21:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:21:40,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-11-08 17:21:40,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 117 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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) [2024-11-08 17:21:40,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:40,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-11-08 17:21:40,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:40,698 INFO L124 PetriNetUnfolderBase]: 142/532 cut-off events. [2024-11-08 17:21:40,699 INFO L125 PetriNetUnfolderBase]: For 146/148 co-relation queries the response was YES. [2024-11-08 17:21:40,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 532 events. 142/532 cut-off events. For 146/148 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2738 event pairs, 31 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 1063. Up to 257 conditions per place. [2024-11-08 17:21:40,704 INFO L140 encePairwiseOnDemand]: 84/99 looper letters, 36 selfloop transitions, 48 changer transitions 13/160 dead transitions. [2024-11-08 17:21:40,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 160 transitions, 689 flow [2024-11-08 17:21:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 516 transitions. [2024-11-08 17:21:40,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2024-11-08 17:21:40,706 INFO L175 Difference]: Start difference. First operand has 108 places, 117 transitions, 365 flow. Second operand 6 states and 516 transitions. [2024-11-08 17:21:40,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 160 transitions, 689 flow [2024-11-08 17:21:40,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 160 transitions, 689 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:40,713 INFO L231 Difference]: Finished difference. Result has 118 places, 147 transitions, 720 flow [2024-11-08 17:21:40,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=720, PETRI_PLACES=118, PETRI_TRANSITIONS=147} [2024-11-08 17:21:40,714 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2024-11-08 17:21:40,715 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 720 flow [2024-11-08 17:21:40,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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) [2024-11-08 17:21:40,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:40,716 INFO L204 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, 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] [2024-11-08 17:21:40,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:21:40,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:40,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1121135359, now seen corresponding path program 1 times [2024-11-08 17:21:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157444835] [2024-11-08 17:21:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:21:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:41,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157444835] [2024-11-08 17:21:41,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157444835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:41,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630148660] [2024-11-08 17:21:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:41,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:21:41,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:21:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:21:41,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-11-08 17:21:41,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 720 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 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) [2024-11-08 17:21:41,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:41,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-11-08 17:21:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:41,525 INFO L124 PetriNetUnfolderBase]: 143/521 cut-off events. [2024-11-08 17:21:41,525 INFO L125 PetriNetUnfolderBase]: For 443/453 co-relation queries the response was YES. [2024-11-08 17:21:41,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 521 events. 143/521 cut-off events. For 443/453 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2877 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1513. Up to 241 conditions per place. [2024-11-08 17:21:41,530 INFO L140 encePairwiseOnDemand]: 88/99 looper letters, 73 selfloop transitions, 25 changer transitions 13/175 dead transitions. [2024-11-08 17:21:41,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 175 transitions, 1103 flow [2024-11-08 17:21:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2024-11-08 17:21:41,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8400673400673401 [2024-11-08 17:21:41,533 INFO L175 Difference]: Start difference. First operand has 118 places, 147 transitions, 720 flow. Second operand 6 states and 499 transitions. [2024-11-08 17:21:41,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 175 transitions, 1103 flow [2024-11-08 17:21:41,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 175 transitions, 1084 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-08 17:21:41,547 INFO L231 Difference]: Finished difference. Result has 117 places, 162 transitions, 936 flow [2024-11-08 17:21:41,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=117, PETRI_TRANSITIONS=162} [2024-11-08 17:21:41,548 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2024-11-08 17:21:41,548 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 162 transitions, 936 flow [2024-11-08 17:21:41,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 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) [2024-11-08 17:21:41,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:41,549 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:41,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:21:41,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-08 17:21:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1588430567, now seen corresponding path program 1 times [2024-11-08 17:21:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343377671] [2024-11-08 17:21:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:21:41,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:21:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:21:41,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:21:41,641 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:21:41,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-08 17:21:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-08 17:21:41,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-08 17:21:41,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-08 17:21:41,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-08 17:21:41,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-08 17:21:41,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-08 17:21:41,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-08 17:21:41,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-08 17:21:41,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:21:41,647 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:41,650 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 17:21:41,650 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-08 17:21:41,685 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-08 17:21:41,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 258 flow [2024-11-08 17:21:41,732 INFO L124 PetriNetUnfolderBase]: 11/232 cut-off events. [2024-11-08 17:21:41,733 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-08 17:21:41,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 232 events. 11/232 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 514 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 138. Up to 8 conditions per place. [2024-11-08 17:21:41,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 258 flow [2024-11-08 17:21:41,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 258 flow [2024-11-08 17:21:41,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:21:41,738 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1b6009d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:21:41,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-08 17:21:41,741 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 17:21:41,741 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-08 17:21:41,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 17:21:41,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:41,741 INFO L204 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] [2024-11-08 17:21:41,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1901011823, now seen corresponding path program 1 times [2024-11-08 17:21:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089072638] [2024-11-08 17:21:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089072638] [2024-11-08 17:21:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089072638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:21:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513528165] [2024-11-08 17:21:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:41,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:21:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:41,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:21:41,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:21:41,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 121 [2024-11-08 17:21:41,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-11-08 17:21:41,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:41,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 121 [2024-11-08 17:21:41,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:41,901 INFO L124 PetriNetUnfolderBase]: 27/459 cut-off events. [2024-11-08 17:21:41,901 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-08 17:21:41,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 459 events. 27/459 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1891 event pairs, 16 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 297. Up to 50 conditions per place. [2024-11-08 17:21:41,905 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 11 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2024-11-08 17:21:41,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 280 flow [2024-11-08 17:21:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:21:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:21:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2024-11-08 17:21:41,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173553719008265 [2024-11-08 17:21:41,907 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 258 flow. Second operand 3 states and 333 transitions. [2024-11-08 17:21:41,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 280 flow [2024-11-08 17:21:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:41,910 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 256 flow [2024-11-08 17:21:41,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2024-11-08 17:21:41,913 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 1 predicate places. [2024-11-08 17:21:41,913 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 256 flow [2024-11-08 17:21:41,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-11-08 17:21:41,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:41,914 INFO L204 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, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:41,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:21:41,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:41,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1761674347, now seen corresponding path program 1 times [2024-11-08 17:21:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:41,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719455521] [2024-11-08 17:21:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719455521] [2024-11-08 17:21:41,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719455521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:41,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:41,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:21:41,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586428762] [2024-11-08 17:21:41,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:41,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:21:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:21:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:21:41,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 121 [2024-11-08 17:21:41,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2024-11-08 17:21:41,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:41,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 121 [2024-11-08 17:21:41,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:42,075 INFO L124 PetriNetUnfolderBase]: 62/663 cut-off events. [2024-11-08 17:21:42,076 INFO L125 PetriNetUnfolderBase]: For 40/45 co-relation queries the response was YES. [2024-11-08 17:21:42,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 663 events. 62/663 cut-off events. For 40/45 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3336 event pairs, 28 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 757. Up to 97 conditions per place. [2024-11-08 17:21:42,081 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 12 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-08 17:21:42,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 293 flow [2024-11-08 17:21:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:21:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:21:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-08 17:21:42,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9256198347107438 [2024-11-08 17:21:42,083 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 256 flow. Second operand 3 states and 336 transitions. [2024-11-08 17:21:42,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 293 flow [2024-11-08 17:21:42,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 17:21:42,086 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 267 flow [2024-11-08 17:21:42,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2024-11-08 17:21:42,087 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2024-11-08 17:21:42,088 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 267 flow [2024-11-08 17:21:42,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2024-11-08 17:21:42,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:42,089 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:42,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:21:42,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:42,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2041235342, now seen corresponding path program 1 times [2024-11-08 17:21:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096787476] [2024-11-08 17:21:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096787476] [2024-11-08 17:21:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096787476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969357976] [2024-11-08 17:21:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:42,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:21:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:21:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:21:42,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 121 [2024-11-08 17:21:42,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 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) [2024-11-08 17:21:42,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:42,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 121 [2024-11-08 17:21:42,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:42,448 INFO L124 PetriNetUnfolderBase]: 21/369 cut-off events. [2024-11-08 17:21:42,449 INFO L125 PetriNetUnfolderBase]: For 23/46 co-relation queries the response was YES. [2024-11-08 17:21:42,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 369 events. 21/369 cut-off events. For 23/46 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1241 event pairs, 2 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 249. Up to 47 conditions per place. [2024-11-08 17:21:42,452 INFO L140 encePairwiseOnDemand]: 112/121 looper letters, 16 selfloop transitions, 2 changer transitions 6/125 dead transitions. [2024-11-08 17:21:42,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 125 transitions, 329 flow [2024-11-08 17:21:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2024-11-08 17:21:42,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8856749311294766 [2024-11-08 17:21:42,456 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 267 flow. Second operand 6 states and 643 transitions. [2024-11-08 17:21:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 125 transitions, 329 flow [2024-11-08 17:21:42,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 329 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:42,460 INFO L231 Difference]: Finished difference. Result has 128 places, 119 transitions, 291 flow [2024-11-08 17:21:42,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2024-11-08 17:21:42,461 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 7 predicate places. [2024-11-08 17:21:42,462 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 119 transitions, 291 flow [2024-11-08 17:21:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 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) [2024-11-08 17:21:42,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:42,463 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:42,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:21:42,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -137038987, now seen corresponding path program 1 times [2024-11-08 17:21:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849970047] [2024-11-08 17:21:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849970047] [2024-11-08 17:21:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849970047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89689358] [2024-11-08 17:21:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:21:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:21:42,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:21:42,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 121 [2024-11-08 17:21:42,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 119 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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) [2024-11-08 17:21:42,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:42,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 121 [2024-11-08 17:21:42,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:43,675 INFO L124 PetriNetUnfolderBase]: 1036/3165 cut-off events. [2024-11-08 17:21:43,675 INFO L125 PetriNetUnfolderBase]: For 201/207 co-relation queries the response was YES. [2024-11-08 17:21:43,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5230 conditions, 3165 events. 1036/3165 cut-off events. For 201/207 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25511 event pairs, 589 based on Foata normal form. 0/2845 useless extension candidates. Maximal degree in co-relation 4628. Up to 1573 conditions per place. [2024-11-08 17:21:43,695 INFO L140 encePairwiseOnDemand]: 106/121 looper letters, 31 selfloop transitions, 38 changer transitions 0/157 dead transitions. [2024-11-08 17:21:43,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 157 transitions, 510 flow [2024-11-08 17:21:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions. [2024-11-08 17:21:43,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8388429752066116 [2024-11-08 17:21:43,698 INFO L175 Difference]: Start difference. First operand has 128 places, 119 transitions, 291 flow. Second operand 6 states and 609 transitions. [2024-11-08 17:21:43,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 157 transitions, 510 flow [2024-11-08 17:21:43,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 157 transitions, 498 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-08 17:21:43,702 INFO L231 Difference]: Finished difference. Result has 131 places, 156 transitions, 533 flow [2024-11-08 17:21:43,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=131, PETRI_TRANSITIONS=156} [2024-11-08 17:21:43,704 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2024-11-08 17:21:43,704 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 156 transitions, 533 flow [2024-11-08 17:21:43,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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) [2024-11-08 17:21:43,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:43,705 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:43,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:21:43,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:43,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1360453517, now seen corresponding path program 1 times [2024-11-08 17:21:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:43,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455386789] [2024-11-08 17:21:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455386789] [2024-11-08 17:21:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455386789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:44,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847776084] [2024-11-08 17:21:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:44,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:21:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:21:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:21:44,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 121 [2024-11-08 17:21:44,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 156 transitions, 533 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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) [2024-11-08 17:21:44,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:44,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 121 [2024-11-08 17:21:44,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:45,839 INFO L124 PetriNetUnfolderBase]: 2596/7276 cut-off events. [2024-11-08 17:21:45,839 INFO L125 PetriNetUnfolderBase]: For 1977/2647 co-relation queries the response was YES. [2024-11-08 17:21:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15664 conditions, 7276 events. 2596/7276 cut-off events. For 1977/2647 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 66620 event pairs, 643 based on Foata normal form. 22/6667 useless extension candidates. Maximal degree in co-relation 13134. Up to 3100 conditions per place. [2024-11-08 17:21:45,898 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 87 selfloop transitions, 86 changer transitions 0/266 dead transitions. [2024-11-08 17:21:45,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 266 transitions, 1363 flow [2024-11-08 17:21:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2024-11-08 17:21:45,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9008264462809917 [2024-11-08 17:21:45,902 INFO L175 Difference]: Start difference. First operand has 131 places, 156 transitions, 533 flow. Second operand 6 states and 654 transitions. [2024-11-08 17:21:45,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 266 transitions, 1363 flow [2024-11-08 17:21:45,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 266 transitions, 1363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:45,921 INFO L231 Difference]: Finished difference. Result has 140 places, 239 transitions, 1259 flow [2024-11-08 17:21:45,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1259, PETRI_PLACES=140, PETRI_TRANSITIONS=239} [2024-11-08 17:21:45,923 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 19 predicate places. [2024-11-08 17:21:45,923 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 239 transitions, 1259 flow [2024-11-08 17:21:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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) [2024-11-08 17:21:45,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:45,924 INFO L204 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, 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] [2024-11-08 17:21:45,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:21:45,925 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:45,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 732234116, now seen corresponding path program 1 times [2024-11-08 17:21:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303610902] [2024-11-08 17:21:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:21:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303610902] [2024-11-08 17:21:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303610902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:46,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:21:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528403966] [2024-11-08 17:21:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:46,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:21:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:21:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:21:46,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 121 [2024-11-08 17:21:46,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 239 transitions, 1259 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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) [2024-11-08 17:21:46,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:46,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 121 [2024-11-08 17:21:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:48,367 INFO L124 PetriNetUnfolderBase]: 3107/8978 cut-off events. [2024-11-08 17:21:48,368 INFO L125 PetriNetUnfolderBase]: For 7046/7442 co-relation queries the response was YES. [2024-11-08 17:21:48,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24775 conditions, 8978 events. 3107/8978 cut-off events. For 7046/7442 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 88993 event pairs, 520 based on Foata normal form. 22/8382 useless extension candidates. Maximal degree in co-relation 23776. Up to 4189 conditions per place. [2024-11-08 17:21:48,469 INFO L140 encePairwiseOnDemand]: 106/121 looper letters, 135 selfloop transitions, 71 changer transitions 0/307 dead transitions. [2024-11-08 17:21:48,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 307 transitions, 2115 flow [2024-11-08 17:21:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:21:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:21:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2024-11-08 17:21:48,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8539944903581267 [2024-11-08 17:21:48,472 INFO L175 Difference]: Start difference. First operand has 140 places, 239 transitions, 1259 flow. Second operand 6 states and 620 transitions. [2024-11-08 17:21:48,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 307 transitions, 2115 flow [2024-11-08 17:21:48,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 307 transitions, 2097 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:48,621 INFO L231 Difference]: Finished difference. Result has 150 places, 305 transitions, 2021 flow [2024-11-08 17:21:48,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2021, PETRI_PLACES=150, PETRI_TRANSITIONS=305} [2024-11-08 17:21:48,622 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 29 predicate places. [2024-11-08 17:21:48,623 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 305 transitions, 2021 flow [2024-11-08 17:21:48,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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) [2024-11-08 17:21:48,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:48,624 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:21:48,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 224636994, now seen corresponding path program 1 times [2024-11-08 17:21:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178252322] [2024-11-08 17:21:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 17:21:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178252322] [2024-11-08 17:21:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178252322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048373879] [2024-11-08 17:21:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:21:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:21:49,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:21:49,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:21:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:49,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 17:21:49,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:21:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-08 17:21:49,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:21:49,544 INFO L378 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 11 treesize of output 11 [2024-11-08 17:21:49,642 INFO L378 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 [2024-11-08 17:21:49,723 INFO L378 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 [2024-11-08 17:21:49,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:21:49,758 INFO L378 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 [2024-11-08 17:21:49,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:21:49,794 INFO L378 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 [2024-11-08 17:21:49,838 INFO L378 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 56 treesize of output 45 [2024-11-08 17:21:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 17:21:49,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:21:49,899 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-08 17:21:49,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-08 17:21:49,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (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 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_250) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-08 17:21:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2024-11-08 17:21:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048373879] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:21:53,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:21:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2024-11-08 17:21:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343946934] [2024-11-08 17:21:53,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:21:53,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:21:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:21:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=123, Unknown=3, NotChecked=72, Total=240 [2024-11-08 17:21:53,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-08 17:21:53,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 305 transitions, 2021 flow. Second operand has 16 states, 16 states have (on average 68.375) internal successors, (1094), 16 states have internal predecessors, (1094), 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) [2024-11-08 17:21:53,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:53,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-08 17:21:53,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:21:57,911 INFO L124 PetriNetUnfolderBase]: 8857/19740 cut-off events. [2024-11-08 17:21:57,911 INFO L125 PetriNetUnfolderBase]: For 24926/24933 co-relation queries the response was YES. [2024-11-08 17:21:57,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60658 conditions, 19740 events. 8857/19740 cut-off events. For 24926/24933 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 194182 event pairs, 3017 based on Foata normal form. 172/18789 useless extension candidates. Maximal degree in co-relation 58620. Up to 8938 conditions per place. [2024-11-08 17:21:58,086 INFO L140 encePairwiseOnDemand]: 107/121 looper letters, 391 selfloop transitions, 36 changer transitions 0/496 dead transitions. [2024-11-08 17:21:58,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 496 transitions, 4311 flow [2024-11-08 17:21:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:21:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-08 17:21:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 996 transitions. [2024-11-08 17:21:58,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6331849968213604 [2024-11-08 17:21:58,091 INFO L175 Difference]: Start difference. First operand has 150 places, 305 transitions, 2021 flow. Second operand 13 states and 996 transitions. [2024-11-08 17:21:58,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 496 transitions, 4311 flow [2024-11-08 17:21:58,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 496 transitions, 4171 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-08 17:21:58,256 INFO L231 Difference]: Finished difference. Result has 161 places, 304 transitions, 1949 flow [2024-11-08 17:21:58,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1949, PETRI_PLACES=161, PETRI_TRANSITIONS=304} [2024-11-08 17:21:58,257 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 40 predicate places. [2024-11-08 17:21:58,258 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 304 transitions, 1949 flow [2024-11-08 17:21:58,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 68.375) internal successors, (1094), 16 states have internal predecessors, (1094), 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) [2024-11-08 17:21:58,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:21:58,259 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:21:58,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:21:58,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74e2f6-7915-4acf-bfbb-23a9617c3a33/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 17:21:58,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:21:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1549318778, now seen corresponding path program 1 times [2024-11-08 17:21:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408843551] [2024-11-08 17:21:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:21:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:59,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408843551] [2024-11-08 17:21:59,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408843551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:59,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:21:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396107368] [2024-11-08 17:21:59,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:21:59,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:21:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:21:59,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 121 [2024-11-08 17:21:59,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 304 transitions, 1949 flow. Second operand has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 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) [2024-11-08 17:21:59,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:21:59,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 121 [2024-11-08 17:21:59,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:02,951 INFO L124 PetriNetUnfolderBase]: 5355/13558 cut-off events. [2024-11-08 17:22:02,951 INFO L125 PetriNetUnfolderBase]: For 19376/23517 co-relation queries the response was YES. [2024-11-08 17:22:02,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45258 conditions, 13558 events. 5355/13558 cut-off events. For 19376/23517 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 133453 event pairs, 734 based on Foata normal form. 407/13348 useless extension candidates. Maximal degree in co-relation 41208. Up to 3241 conditions per place. [2024-11-08 17:22:03,075 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 342 selfloop transitions, 262 changer transitions 6/695 dead transitions. [2024-11-08 17:22:03,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 695 transitions, 6053 flow [2024-11-08 17:22:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:22:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-08 17:22:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1686 transitions. [2024-11-08 17:22:03,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741046831955923 [2024-11-08 17:22:03,083 INFO L175 Difference]: Start difference. First operand has 161 places, 304 transitions, 1949 flow. Second operand 18 states and 1686 transitions. [2024-11-08 17:22:03,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 695 transitions, 6053 flow [2024-11-08 17:22:03,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 695 transitions, 5909 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-08 17:22:03,356 INFO L231 Difference]: Finished difference. Result has 176 places, 510 transitions, 4585 flow [2024-11-08 17:22:03,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4585, PETRI_PLACES=176, PETRI_TRANSITIONS=510} [2024-11-08 17:22:03,357 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 55 predicate places. [2024-11-08 17:22:03,357 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 510 transitions, 4585 flow [2024-11-08 17:22:03,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 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) [2024-11-08 17:22:03,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:03,358 INFO L204 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:22:03,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:22:03,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1066310071, now seen corresponding path program 1 times [2024-11-08 17:22:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115195170] [2024-11-08 17:22:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:22:03,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115195170] [2024-11-08 17:22:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115195170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:03,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:22:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30963526] [2024-11-08 17:22:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:03,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:22:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:22:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:22:04,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 121 [2024-11-08 17:22:04,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 510 transitions, 4585 flow. Second operand has 11 states, 11 states have (on average 85.81818181818181) internal successors, (944), 11 states have internal predecessors, (944), 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) [2024-11-08 17:22:04,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:04,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 121 [2024-11-08 17:22:04,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:07,589 INFO L124 PetriNetUnfolderBase]: 4542/12169 cut-off events. [2024-11-08 17:22:07,589 INFO L125 PetriNetUnfolderBase]: For 34770/35736 co-relation queries the response was YES. [2024-11-08 17:22:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48179 conditions, 12169 events. 4542/12169 cut-off events. For 34770/35736 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 121874 event pairs, 443 based on Foata normal form. 225/11766 useless extension candidates. Maximal degree in co-relation 46795. Up to 3243 conditions per place. [2024-11-08 17:22:07,696 INFO L140 encePairwiseOnDemand]: 107/121 looper letters, 495 selfloop transitions, 44 changer transitions 0/662 dead transitions. [2024-11-08 17:22:07,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 662 transitions, 7548 flow [2024-11-08 17:22:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:22:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-08 17:22:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1176 transitions. [2024-11-08 17:22:07,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7476160203432931 [2024-11-08 17:22:07,700 INFO L175 Difference]: Start difference. First operand has 176 places, 510 transitions, 4585 flow. Second operand 13 states and 1176 transitions. [2024-11-08 17:22:07,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 662 transitions, 7548 flow [2024-11-08 17:22:07,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 662 transitions, 7470 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-11-08 17:22:07,957 INFO L231 Difference]: Finished difference. Result has 182 places, 509 transitions, 4599 flow [2024-11-08 17:22:07,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=4511, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4599, PETRI_PLACES=182, PETRI_TRANSITIONS=509} [2024-11-08 17:22:07,958 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 61 predicate places. [2024-11-08 17:22:07,958 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 509 transitions, 4599 flow [2024-11-08 17:22:07,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.81818181818181) internal successors, (944), 11 states have internal predecessors, (944), 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) [2024-11-08 17:22:07,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:07,959 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:07,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:22:07,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:22:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1401362072, now seen corresponding path program 1 times [2024-11-08 17:22:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536134651] [2024-11-08 17:22:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 17:22:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536134651] [2024-11-08 17:22:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536134651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:08,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:08,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627582726] [2024-11-08 17:22:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:08,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:22:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:22:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:08,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 121 [2024-11-08 17:22:08,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 509 transitions, 4599 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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) [2024-11-08 17:22:08,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:08,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 121 [2024-11-08 17:22:08,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:10,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([369] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} AuxVars[] AssignedVars[#race][324], [Black: 127#true, 32#L1023-11true, Black: 133#(= |ULTIMATE.start_main_~i~1#1| 0), 153#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 39#L1023-7true, 659#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 98#L1037-1true, 142#true, Black: 156#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 157#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 120#true, Black: 155#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 158#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 122#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 599#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 617#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 603#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 593#true, Black: 613#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 615#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 601#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 619#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 602#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 600#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 598#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 129#(= |#race~datas~0| 0), 635#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 163#true]) [2024-11-08 17:22:10,087 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-08 17:22:10,087 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-08 17:22:10,087 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-08 17:22:10,087 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-08 17:22:13,449 INFO L124 PetriNetUnfolderBase]: 10024/22641 cut-off events. [2024-11-08 17:22:13,449 INFO L125 PetriNetUnfolderBase]: For 76609/77623 co-relation queries the response was YES. [2024-11-08 17:22:13,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92080 conditions, 22641 events. 10024/22641 cut-off events. For 76609/77623 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 230660 event pairs, 1245 based on Foata normal form. 11/21406 useless extension candidates. Maximal degree in co-relation 89986. Up to 11553 conditions per place. [2024-11-08 17:22:13,703 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 363 selfloop transitions, 355 changer transitions 12/866 dead transitions. [2024-11-08 17:22:13,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 866 transitions, 9433 flow [2024-11-08 17:22:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:22:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:22:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 650 transitions. [2024-11-08 17:22:13,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953168044077136 [2024-11-08 17:22:13,706 INFO L175 Difference]: Start difference. First operand has 182 places, 509 transitions, 4599 flow. Second operand 6 states and 650 transitions. [2024-11-08 17:22:13,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 866 transitions, 9433 flow [2024-11-08 17:22:14,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 866 transitions, 9197 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-08 17:22:14,390 INFO L231 Difference]: Finished difference. Result has 179 places, 784 transitions, 8350 flow [2024-11-08 17:22:14,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=4511, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8350, PETRI_PLACES=179, PETRI_TRANSITIONS=784} [2024-11-08 17:22:14,390 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 58 predicate places. [2024-11-08 17:22:14,391 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 784 transitions, 8350 flow [2024-11-08 17:22:14,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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) [2024-11-08 17:22:14,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:14,391 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1] [2024-11-08 17:22:14,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:22:14,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-08 17:22:14,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 63310234, now seen corresponding path program 1 times [2024-11-08 17:22:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790006174] [2024-11-08 17:22:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:22:14,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:22:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:22:14,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:22:14,433 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:22:14,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-08 17:22:14,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-08 17:22:14,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-08 17:22:14,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-08 17:22:14,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-08 17:22:14,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-08 17:22:14,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-08 17:22:14,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-08 17:22:14,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-08 17:22:14,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-08 17:22:14,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-08 17:22:14,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:22:14,435 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:14,436 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 17:22:14,436 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-08 17:22:14,461 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 17:22:14,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 143 transitions, 313 flow [2024-11-08 17:22:14,516 INFO L124 PetriNetUnfolderBase]: 21/383 cut-off events. [2024-11-08 17:22:14,516 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-08 17:22:14,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 383 events. 21/383 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1069 event pairs, 1 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 240. Up to 16 conditions per place. [2024-11-08 17:22:14,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 143 transitions, 313 flow [2024-11-08 17:22:14,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 143 transitions, 313 flow [2024-11-08 17:22:14,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:22:14,521 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1b6009d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:22:14,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-08 17:22:14,524 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 17:22:14,524 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-08 17:22:14,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 17:22:14,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:14,524 INFO L204 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] [2024-11-08 17:22:14,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-08 17:22:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 436288350, now seen corresponding path program 1 times [2024-11-08 17:22:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822237286] [2024-11-08 17:22:14,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:22:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822237286] [2024-11-08 17:22:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822237286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616496022] [2024-11-08 17:22:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:22:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:22:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:22:14,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 143 [2024-11-08 17:22:14,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2024-11-08 17:22:14,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:14,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 143 [2024-11-08 17:22:14,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:14,791 INFO L124 PetriNetUnfolderBase]: 108/1299 cut-off events. [2024-11-08 17:22:14,792 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-08 17:22:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 1299 events. 108/1299 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8405 event pairs, 81 based on Foata normal form. 1/1122 useless extension candidates. Maximal degree in co-relation 900. Up to 178 conditions per place. [2024-11-08 17:22:14,800 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 14 selfloop transitions, 2 changer transitions 1/141 dead transitions. [2024-11-08 17:22:14,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 341 flow [2024-11-08 17:22:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:22:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:22:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-11-08 17:22:14,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.916083916083916 [2024-11-08 17:22:14,802 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 313 flow. Second operand 3 states and 393 transitions. [2024-11-08 17:22:14,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 341 flow [2024-11-08 17:22:14,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 141 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:22:14,805 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 311 flow [2024-11-08 17:22:14,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2024-11-08 17:22:14,806 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2024-11-08 17:22:14,806 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 311 flow [2024-11-08 17:22:14,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2024-11-08 17:22:14,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:14,807 INFO L204 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, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:14,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:22:14,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-08 17:22:14,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -464620469, now seen corresponding path program 1 times [2024-11-08 17:22:14,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696807888] [2024-11-08 17:22:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:22:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696807888] [2024-11-08 17:22:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696807888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975535236] [2024-11-08 17:22:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:14,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:22:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:22:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:22:14,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2024-11-08 17:22:14,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2024-11-08 17:22:14,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:14,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2024-11-08 17:22:14,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:15,223 INFO L124 PetriNetUnfolderBase]: 345/2534 cut-off events. [2024-11-08 17:22:15,224 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2024-11-08 17:22:15,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 2534 events. 345/2534 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 20299 event pairs, 214 based on Foata normal form. 0/2266 useless extension candidates. Maximal degree in co-relation 3121. Up to 507 conditions per place. [2024-11-08 17:22:15,241 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 17 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-11-08 17:22:15,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 142 transitions, 369 flow [2024-11-08 17:22:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:22:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:22:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-11-08 17:22:15,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9184149184149184 [2024-11-08 17:22:15,243 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 311 flow. Second operand 3 states and 394 transitions. [2024-11-08 17:22:15,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 142 transitions, 369 flow [2024-11-08 17:22:15,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 17:22:15,246 INFO L231 Difference]: Finished difference. Result has 141 places, 140 transitions, 327 flow [2024-11-08 17:22:15,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=141, PETRI_TRANSITIONS=140} [2024-11-08 17:22:15,247 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, -3 predicate places. [2024-11-08 17:22:15,247 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 140 transitions, 327 flow [2024-11-08 17:22:15,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2024-11-08 17:22:15,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:15,248 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:15,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:22:15,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-08 17:22:15,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1377498717, now seen corresponding path program 1 times [2024-11-08 17:22:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563359350] [2024-11-08 17:22:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:22:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563359350] [2024-11-08 17:22:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563359350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:15,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255627689] [2024-11-08 17:22:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:15,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:15,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:15,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2024-11-08 17:22:15,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 140 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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) [2024-11-08 17:22:15,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:15,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2024-11-08 17:22:15,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:15,700 INFO L124 PetriNetUnfolderBase]: 70/897 cut-off events. [2024-11-08 17:22:15,701 INFO L125 PetriNetUnfolderBase]: For 137/216 co-relation queries the response was YES. [2024-11-08 17:22:15,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 897 events. 70/897 cut-off events. For 137/216 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4814 event pairs, 17 based on Foata normal form. 2/839 useless extension candidates. Maximal degree in co-relation 627. Up to 117 conditions per place. [2024-11-08 17:22:15,706 INFO L140 encePairwiseOnDemand]: 134/143 looper letters, 18 selfloop transitions, 2 changer transitions 6/147 dead transitions. [2024-11-08 17:22:15,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 147 transitions, 393 flow [2024-11-08 17:22:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:22:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:22:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2024-11-08 17:22:15,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8916083916083916 [2024-11-08 17:22:15,709 INFO L175 Difference]: Start difference. First operand has 141 places, 140 transitions, 327 flow. Second operand 6 states and 765 transitions. [2024-11-08 17:22:15,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 147 transitions, 393 flow [2024-11-08 17:22:15,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 147 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:22:15,712 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 351 flow [2024-11-08 17:22:15,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2024-11-08 17:22:15,713 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 6 predicate places. [2024-11-08 17:22:15,714 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 351 flow [2024-11-08 17:22:15,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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) [2024-11-08 17:22:15,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:15,714 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:15,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:22:15,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-08 17:22:15,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash -800775612, now seen corresponding path program 1 times [2024-11-08 17:22:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126893997] [2024-11-08 17:22:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:22:15,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:15,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126893997] [2024-11-08 17:22:15,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126893997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:15,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:15,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149366623] [2024-11-08 17:22:15,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:15,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:22:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:15,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:22:15,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:16,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2024-11-08 17:22:16,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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) [2024-11-08 17:22:16,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:16,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2024-11-08 17:22:16,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:19,420 INFO L124 PetriNetUnfolderBase]: 10431/23883 cut-off events. [2024-11-08 17:22:19,420 INFO L125 PetriNetUnfolderBase]: For 2031/2090 co-relation queries the response was YES. [2024-11-08 17:22:19,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40929 conditions, 23883 events. 10431/23883 cut-off events. For 2031/2090 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 240802 event pairs, 6820 based on Foata normal form. 0/21790 useless extension candidates. Maximal degree in co-relation 35735. Up to 14041 conditions per place. [2024-11-08 17:22:19,550 INFO L140 encePairwiseOnDemand]: 124/143 looper letters, 38 selfloop transitions, 54 changer transitions 0/196 dead transitions. [2024-11-08 17:22:19,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 196 transitions, 657 flow [2024-11-08 17:22:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:22:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:22:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2024-11-08 17:22:19,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2024-11-08 17:22:19,552 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 351 flow. Second operand 6 states and 728 transitions. [2024-11-08 17:22:19,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 196 transitions, 657 flow [2024-11-08 17:22:19,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 196 transitions, 645 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-08 17:22:19,567 INFO L231 Difference]: Finished difference. Result has 153 places, 194 transitions, 697 flow [2024-11-08 17:22:19,568 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=153, PETRI_TRANSITIONS=194} [2024-11-08 17:22:19,568 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2024-11-08 17:22:19,568 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 194 transitions, 697 flow [2024-11-08 17:22:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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) [2024-11-08 17:22:19,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:19,569 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:19,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:22:19,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-08 17:22:19,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash 864028769, now seen corresponding path program 1 times [2024-11-08 17:22:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:19,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672615279] [2024-11-08 17:22:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:22:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672615279] [2024-11-08 17:22:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672615279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:20,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835863823] [2024-11-08 17:22:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:20,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:22:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:22:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:20,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2024-11-08 17:22:20,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 194 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2024-11-08 17:22:20,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:20,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2024-11-08 17:22:20,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:22:25,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][297], [139#L1023-11true, Black: 156#(= |ULTIMATE.start_main_~i~1#1| 0), 145#true, 102#L1032-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 152#(= |#race~datas~0| 0), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 10#L1023-8true, 143#true, 141#true, 39#L1023-7true, 165#true, Black: 150#true, 176#true]) [2024-11-08 17:22:25,541 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-08 17:22:25,541 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-08 17:22:25,541 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-08 17:22:25,541 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-08 17:22:25,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][297], [139#L1023-11true, Black: 156#(= |ULTIMATE.start_main_~i~1#1| 0), 145#true, 102#L1032-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 152#(= |#race~datas~0| 0), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 143#true, 141#true, 39#L1023-7true, 67#L1023-9true, 165#true, Black: 150#true, 176#true]) [2024-11-08 17:22:25,761 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,761 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,761 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,761 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][242], [Black: 156#(= |ULTIMATE.start_main_~i~1#1| 0), 145#true, 102#L1032-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 152#(= |#race~datas~0| 0), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 141#true, 143#true, 39#L1023-7true, 165#true, 128#L1024true, Black: 150#true, 176#true, 121#L1023-7true]) [2024-11-08 17:22:25,915 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,915 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,915 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,915 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 17:22:25,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][297], [139#L1023-11true, Black: 156#(= |ULTIMATE.start_main_~i~1#1| 0), 145#true, 70#L1023-10true, 102#L1032-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 152#(= |#race~datas~0| 0), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 143#true, 141#true, 39#L1023-7true, 165#true, Black: 150#true, 176#true]) [2024-11-08 17:22:25,948 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-11-08 17:22:25,948 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 17:22:25,948 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 17:22:25,948 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 17:22:29,977 INFO L124 PetriNetUnfolderBase]: 30686/70593 cut-off events. [2024-11-08 17:22:29,978 INFO L125 PetriNetUnfolderBase]: For 20554/26209 co-relation queries the response was YES. [2024-11-08 17:22:30,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157581 conditions, 70593 events. 30686/70593 cut-off events. For 20554/26209 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 811890 event pairs, 7897 based on Foata normal form. 89/64771 useless extension candidates. Maximal degree in co-relation 129121. Up to 30623 conditions per place. [2024-11-08 17:22:30,486 INFO L140 encePairwiseOnDemand]: 120/143 looper letters, 129 selfloop transitions, 118 changer transitions 0/356 dead transitions. [2024-11-08 17:22:30,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 356 transitions, 1963 flow [2024-11-08 17:22:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:22:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:22:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2024-11-08 17:22:30,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2024-11-08 17:22:30,488 INFO L175 Difference]: Start difference. First operand has 153 places, 194 transitions, 697 flow. Second operand 6 states and 780 transitions. [2024-11-08 17:22:30,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 356 transitions, 1963 flow [2024-11-08 17:22:30,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 356 transitions, 1963 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 17:22:30,655 INFO L231 Difference]: Finished difference. Result has 162 places, 311 transitions, 1770 flow [2024-11-08 17:22:30,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1770, PETRI_PLACES=162, PETRI_TRANSITIONS=311} [2024-11-08 17:22:30,656 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2024-11-08 17:22:30,656 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 311 transitions, 1770 flow [2024-11-08 17:22:30,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2024-11-08 17:22:30,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:22:30,657 INFO L204 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, 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] [2024-11-08 17:22:30,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:22:30,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-08 17:22:30,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash -787077665, now seen corresponding path program 1 times [2024-11-08 17:22:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897691672] [2024-11-08 17:22:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:22:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897691672] [2024-11-08 17:22:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897691672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378172534] [2024-11-08 17:22:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:22:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:22:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:31,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2024-11-08 17:22:31,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 311 transitions, 1770 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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) [2024-11-08 17:22:31,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:22:31,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2024-11-08 17:22:31,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand