./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB --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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:49:21,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:49:21,139 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 04:49:21,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:49:21,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:49:21,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:49:21,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:49:21,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:49:21,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:49:21,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:49:21,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:49:21,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:49:21,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:49:21,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:49:21,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:49:21,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:49:21,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:49:21,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:49:21,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:49:21,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:49:21,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:49:21,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:49:21,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:49:21,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:49:21,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:49:21,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:49:21,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:49:21,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:49:21,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:49:21,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:49:21,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:49:21,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:49:21,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:49:21,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:49:21,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2024-11-28 04:49:21,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:49:21,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:49:21,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:49:21,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:49:21,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:49:21,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-11-28 04:49:25,479 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/data/4edd04399/20df81e4164b44a6beceaae5ebc26cba/FLAGc5fe81546 [2024-11-28 04:49:25,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:49:25,861 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-11-28 04:49:25,871 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/data/4edd04399/20df81e4164b44a6beceaae5ebc26cba/FLAGc5fe81546 [2024-11-28 04:49:25,891 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/data/4edd04399/20df81e4164b44a6beceaae5ebc26cba [2024-11-28 04:49:25,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:49:25,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:49:25,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:49:25,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:49:25,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:49:25,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:25" (1/1) ... [2024-11-28 04:49:25,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f826c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:25, skipping insertion in model container [2024-11-28 04:49:25,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:25" (1/1) ... [2024-11-28 04:49:25,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:49:26,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:49:26,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:49:26,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:49:26,385 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:49:26,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26 WrapperNode [2024-11-28 04:49:26,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:49:26,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:49:26,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:49:26,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:49:26,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,455 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 189 [2024-11-28 04:49:26,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:49:26,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:49:26,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:49:26,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:49:26,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:49:26,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:49:26,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:49:26,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:49:26,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (1/1) ... [2024-11-28 04:49:26,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:49:26,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:49:26,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:49:26,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:49:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:49:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 04:49:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 04:49:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 04:49:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 04:49:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 04:49:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 04:49:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:49:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:49:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:49:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 04:49:26,636 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 04:49:26,828 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:49:26,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:49:28,061 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 04:49:28,061 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:49:28,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:49:28,109 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 04:49:28,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:28 BoogieIcfgContainer [2024-11-28 04:49:28,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:49:28,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:49:28,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:49:28,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:49:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:49:25" (1/3) ... [2024-11-28 04:49:28,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dbf220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:28, skipping insertion in model container [2024-11-28 04:49:28,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:26" (2/3) ... [2024-11-28 04:49:28,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dbf220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:28, skipping insertion in model container [2024-11-28 04:49:28,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:28" (3/3) ... [2024-11-28 04:49:28,124 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2024-11-28 04:49:28,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:49:28,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 450 locations, 1 initial locations, 4 loop locations, and 54 error locations. [2024-11-28 04:49:28,150 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 04:49:28,410 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 04:49:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 475 transitions, 964 flow [2024-11-28 04:49:28,868 INFO L124 PetriNetUnfolderBase]: 26/473 cut-off events. [2024-11-28 04:49:28,871 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 04:49:28,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 473 events. 26/473 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1063 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 292. Up to 3 conditions per place. [2024-11-28 04:49:28,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 475 transitions, 964 flow [2024-11-28 04:49:28,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 453 transitions, 918 flow [2024-11-28 04:49:28,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:49:28,922 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;@4742cfdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:49:28,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-28 04:49:28,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 04:49:28,933 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-28 04:49:28,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 04:49:28,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:28,934 INFO L206 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] [2024-11-28 04:49:28,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:28,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1056416823, now seen corresponding path program 1 times [2024-11-28 04:49:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761849947] [2024-11-28 04:49:28,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:29,226 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-28 04:49:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761849947] [2024-11-28 04:49:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761849947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691663137] [2024-11-28 04:49:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:29,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:29,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:29,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:29,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-28 04:49:29,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 453 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:29,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:29,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-28 04:49:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:29,741 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2024-11-28 04:49:29,742 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 04:49:29,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3424 event pairs, 8 based on Foata normal form. 15/650 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2024-11-28 04:49:29,759 INFO L140 encePairwiseOnDemand]: 462/475 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2024-11-28 04:49:29,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2024-11-28 04:49:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-28 04:49:29,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-11-28 04:49:29,802 INFO L175 Difference]: Start difference. First operand has 436 places, 453 transitions, 918 flow. Second operand 3 states and 1368 transitions. [2024-11-28 04:49:29,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2024-11-28 04:49:29,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 04:49:29,833 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2024-11-28 04:49:29,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2024-11-28 04:49:29,844 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2024-11-28 04:49:29,847 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2024-11-28 04:49:29,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:29,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:29,849 INFO L206 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] [2024-11-28 04:49:29,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:49:29,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 768821201, now seen corresponding path program 1 times [2024-11-28 04:49:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107276221] [2024-11-28 04:49:29,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:29,971 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-28 04:49:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107276221] [2024-11-28 04:49:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107276221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961737558] [2024-11-28 04:49:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:29,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:29,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:30,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-28 04:49:30,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:30,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:30,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-28 04:49:30,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:30,273 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2024-11-28 04:49:30,273 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:49:30,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3356 event pairs, 8 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2024-11-28 04:49:30,283 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-11-28 04:49:30,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2024-11-28 04:49:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:30,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:30,292 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:30,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2024-11-28 04:49:30,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:30,308 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2024-11-28 04:49:30,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2024-11-28 04:49:30,311 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2024-11-28 04:49:30,311 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2024-11-28 04:49:30,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:30,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:30,312 INFO L206 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] [2024-11-28 04:49:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:49:30,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:30,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1949359592, now seen corresponding path program 1 times [2024-11-28 04:49:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466167365] [2024-11-28 04:49:30,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:30,386 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-28 04:49:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:30,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466167365] [2024-11-28 04:49:30,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466167365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:30,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:30,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:30,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288053165] [2024-11-28 04:49:30,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:30,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:30,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:30,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:30,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:30,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-28 04:49:30,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-28 04:49:30,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:30,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-28 04:49:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:30,659 INFO L124 PetriNetUnfolderBase]: 37/756 cut-off events. [2024-11-28 04:49:30,659 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-28 04:49:30,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 756 events. 37/756 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3101 event pairs, 8 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 758. Up to 32 conditions per place. [2024-11-28 04:49:30,668 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-11-28 04:49:30,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2024-11-28 04:49:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2024-11-28 04:49:30,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515789473684211 [2024-11-28 04:49:30,675 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2024-11-28 04:49:30,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2024-11-28 04:49:30,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:30,685 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2024-11-28 04:49:30,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2024-11-28 04:49:30,688 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-11-28 04:49:30,688 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2024-11-28 04:49:30,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-28 04:49:30,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:30,689 INFO L206 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] [2024-11-28 04:49:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:49:30,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -788697401, now seen corresponding path program 1 times [2024-11-28 04:49:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393861781] [2024-11-28 04:49:30,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:30,809 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-28 04:49:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393861781] [2024-11-28 04:49:30,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393861781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:30,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:30,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:30,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156616751] [2024-11-28 04:49:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:30,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:30,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:30,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:30,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:30,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-28 04:49:30,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-28 04:49:30,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:30,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-28 04:49:30,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:31,067 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2024-11-28 04:49:31,068 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-28 04:49:31,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3164 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2024-11-28 04:49:31,078 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-11-28 04:49:31,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2024-11-28 04:49:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2024-11-28 04:49:31,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515789473684211 [2024-11-28 04:49:31,086 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2024-11-28 04:49:31,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2024-11-28 04:49:31,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:31,094 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2024-11-28 04:49:31,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2024-11-28 04:49:31,096 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2024-11-28 04:49:31,097 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2024-11-28 04:49:31,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-28 04:49:31,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:31,099 INFO L206 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-28 04:49:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:49:31,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 625137524, now seen corresponding path program 1 times [2024-11-28 04:49:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749128991] [2024-11-28 04:49:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:31,171 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-28 04:49:31,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749128991] [2024-11-28 04:49:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749128991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:31,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487936918] [2024-11-28 04:49:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:31,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:31,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:31,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:31,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 475 [2024-11-28 04:49:31,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-28 04:49:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:31,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 475 [2024-11-28 04:49:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:31,542 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2024-11-28 04:49:31,543 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-28 04:49:31,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6748 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2024-11-28 04:49:31,557 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2024-11-28 04:49:31,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2024-11-28 04:49:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2024-11-28 04:49:31,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-11-28 04:49:31,564 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2024-11-28 04:49:31,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2024-11-28 04:49:31,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:31,578 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2024-11-28 04:49:31,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2024-11-28 04:49:31,583 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2024-11-28 04:49:31,583 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2024-11-28 04:49:31,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-28 04:49:31,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:31,585 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:31,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:49:31,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2032672216, now seen corresponding path program 1 times [2024-11-28 04:49:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173361209] [2024-11-28 04:49:31,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:31,799 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-28 04:49:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173361209] [2024-11-28 04:49:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173361209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265206236] [2024-11-28 04:49:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:31,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:31,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:31,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-28 04:49:31,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:31,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:31,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-28 04:49:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:32,050 INFO L124 PetriNetUnfolderBase]: 32/663 cut-off events. [2024-11-28 04:49:32,050 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:49:32,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 663 events. 32/663 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2470 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 644. Up to 28 conditions per place. [2024-11-28 04:49:32,059 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2024-11-28 04:49:32,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 427 transitions, 886 flow [2024-11-28 04:49:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:32,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:32,066 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:32,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 427 transitions, 886 flow [2024-11-28 04:49:32,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 427 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:49:32,078 INFO L231 Difference]: Finished difference. Result has 419 places, 427 transitions, 863 flow [2024-11-28 04:49:32,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=863, PETRI_PLACES=419, PETRI_TRANSITIONS=427} [2024-11-28 04:49:32,082 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2024-11-28 04:49:32,082 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 427 transitions, 863 flow [2024-11-28 04:49:32,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:32,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:32,084 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:32,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:49:32,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1012158375, now seen corresponding path program 1 times [2024-11-28 04:49:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161768483] [2024-11-28 04:49:32,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:33,282 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-28 04:49:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161768483] [2024-11-28 04:49:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161768483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:49:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806594089] [2024-11-28 04:49:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:33,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:49:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:33,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:49:33,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:49:34,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 475 [2024-11-28 04:49:34,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 427 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-28 04:49:34,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:34,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 475 [2024-11-28 04:49:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:34,804 INFO L124 PetriNetUnfolderBase]: 429/2641 cut-off events. [2024-11-28 04:49:34,804 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2024-11-28 04:49:34,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3365 conditions, 2641 events. 429/2641 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19528 event pairs, 288 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 3310. Up to 691 conditions per place. [2024-11-28 04:49:34,828 INFO L140 encePairwiseOnDemand]: 463/475 looper letters, 52 selfloop transitions, 10 changer transitions 0/425 dead transitions. [2024-11-28 04:49:34,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 983 flow [2024-11-28 04:49:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:49:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 04:49:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2024-11-28 04:49:34,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624561403508771 [2024-11-28 04:49:34,837 INFO L175 Difference]: Start difference. First operand has 419 places, 427 transitions, 863 flow. Second operand 6 states and 2458 transitions. [2024-11-28 04:49:34,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 983 flow [2024-11-28 04:49:34,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 425 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:34,847 INFO L231 Difference]: Finished difference. Result has 420 places, 425 transitions, 875 flow [2024-11-28 04:49:34,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=420, PETRI_TRANSITIONS=425} [2024-11-28 04:49:34,850 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -16 predicate places. [2024-11-28 04:49:34,851 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 425 transitions, 875 flow [2024-11-28 04:49:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-28 04:49:34,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:34,854 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:34,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:49:34,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:34,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1256434133, now seen corresponding path program 1 times [2024-11-28 04:49:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038900561] [2024-11-28 04:49:34,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:34,966 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-28 04:49:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038900561] [2024-11-28 04:49:34,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038900561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357994409] [2024-11-28 04:49:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:34,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:34,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:34,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:35,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 475 [2024-11-28 04:49:35,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 425 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-28 04:49:35,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:35,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 475 [2024-11-28 04:49:35,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:35,255 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2024-11-28 04:49:35,256 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-28 04:49:35,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5743 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1120. Up to 82 conditions per place. [2024-11-28 04:49:35,276 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-11-28 04:49:35,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 420 transitions, 895 flow [2024-11-28 04:49:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2024-11-28 04:49:35,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-11-28 04:49:35,282 INFO L175 Difference]: Start difference. First operand has 420 places, 425 transitions, 875 flow. Second operand 3 states and 1349 transitions. [2024-11-28 04:49:35,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 420 transitions, 895 flow [2024-11-28 04:49:35,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 04:49:35,294 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2024-11-28 04:49:35,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2024-11-28 04:49:35,297 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2024-11-28 04:49:35,299 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2024-11-28 04:49:35,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-28 04:49:35,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:35,304 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:35,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:49:35,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:35,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash 683941351, now seen corresponding path program 1 times [2024-11-28 04:49:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:35,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699016134] [2024-11-28 04:49:35,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:35,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:35,429 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-28 04:49:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699016134] [2024-11-28 04:49:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699016134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436503369] [2024-11-28 04:49:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:35,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:35,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:35,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:35,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-28 04:49:35,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:35,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:35,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-28 04:49:35,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:35,668 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2024-11-28 04:49:35,668 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:49:35,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2313 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2024-11-28 04:49:35,676 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2024-11-28 04:49:35,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2024-11-28 04:49:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:35,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:35,682 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:35,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2024-11-28 04:49:35,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:49:35,694 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2024-11-28 04:49:35,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2024-11-28 04:49:35,696 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2024-11-28 04:49:35,697 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2024-11-28 04:49:35,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:35,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:35,698 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:35,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:49:35,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:35,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash 357534485, now seen corresponding path program 1 times [2024-11-28 04:49:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363761070] [2024-11-28 04:49:35,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:35,815 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-28 04:49:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363761070] [2024-11-28 04:49:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363761070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:35,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143519208] [2024-11-28 04:49:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:35,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:35,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:35,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:35,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-28 04:49:35,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-28 04:49:35,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:35,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-28 04:49:35,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:36,102 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2024-11-28 04:49:36,102 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 04:49:36,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6557 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2024-11-28 04:49:36,112 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-11-28 04:49:36,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2024-11-28 04:49:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:36,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:36,118 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:36,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2024-11-28 04:49:36,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:36,130 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2024-11-28 04:49:36,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2024-11-28 04:49:36,132 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-11-28 04:49:36,132 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2024-11-28 04:49:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-28 04:49:36,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:36,134 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:49:36,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -6708649, now seen corresponding path program 1 times [2024-11-28 04:49:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086174694] [2024-11-28 04:49:36,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:36,230 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-28 04:49:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086174694] [2024-11-28 04:49:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086174694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:36,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563803972] [2024-11-28 04:49:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:36,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:36,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:36,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:36,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-28 04:49:36,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-28 04:49:36,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:36,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-28 04:49:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:36,490 INFO L124 PetriNetUnfolderBase]: 70/1083 cut-off events. [2024-11-28 04:49:36,490 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-11-28 04:49:36,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 1083 events. 70/1083 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6234 event pairs, 16 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1111. Up to 61 conditions per place. [2024-11-28 04:49:36,499 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-11-28 04:49:36,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2024-11-28 04:49:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:36,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:36,505 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:36,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2024-11-28 04:49:36,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:49:36,517 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2024-11-28 04:49:36,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2024-11-28 04:49:36,519 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2024-11-28 04:49:36,519 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2024-11-28 04:49:36,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-28 04:49:36,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:36,521 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:36,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:49:36,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1586559801, now seen corresponding path program 1 times [2024-11-28 04:49:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:36,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034388662] [2024-11-28 04:49:36,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:36,617 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-28 04:49:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034388662] [2024-11-28 04:49:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034388662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452885388] [2024-11-28 04:49:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:36,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:36,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:36,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-28 04:49:36,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-28 04:49:36,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:36,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-28 04:49:36,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:36,886 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2024-11-28 04:49:36,886 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-11-28 04:49:36,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4214 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2024-11-28 04:49:36,893 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-28 04:49:36,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2024-11-28 04:49:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-28 04:49:36,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-28 04:49:36,898 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2024-11-28 04:49:36,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2024-11-28 04:49:36,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:49:36,907 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2024-11-28 04:49:36,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2024-11-28 04:49:36,909 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-11-28 04:49:36,909 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2024-11-28 04:49:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-28 04:49:36,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:36,913 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:36,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:49:36,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:36,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash -71144913, now seen corresponding path program 1 times [2024-11-28 04:49:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824639702] [2024-11-28 04:49:36,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:37,026 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-28 04:49:37,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824639702] [2024-11-28 04:49:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824639702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:49:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376292741] [2024-11-28 04:49:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:37,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:37,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:37,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-28 04:49:37,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:37,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:37,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-28 04:49:37,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:37,233 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2024-11-28 04:49:37,233 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-28 04:49:37,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3827 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2024-11-28 04:49:37,241 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2024-11-28 04:49:37,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2024-11-28 04:49:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-28 04:49:37,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-11-28 04:49:37,246 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2024-11-28 04:49:37,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2024-11-28 04:49:37,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:37,256 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2024-11-28 04:49:37,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2024-11-28 04:49:37,258 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2024-11-28 04:49:37,258 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2024-11-28 04:49:37,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:37,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:37,260 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:49:37,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:37,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash -423512786, now seen corresponding path program 1 times [2024-11-28 04:49:37,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:37,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257123970] [2024-11-28 04:49:37,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:37,348 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-28 04:49:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257123970] [2024-11-28 04:49:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257123970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177895723] [2024-11-28 04:49:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:37,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:37,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:37,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-28 04:49:37,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-28 04:49:37,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:37,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-28 04:49:37,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:37,707 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2024-11-28 04:49:37,707 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-28 04:49:37,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8579 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2024-11-28 04:49:37,721 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-11-28 04:49:37,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2024-11-28 04:49:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2024-11-28 04:49:37,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9543859649122807 [2024-11-28 04:49:37,726 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2024-11-28 04:49:37,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2024-11-28 04:49:37,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:37,735 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2024-11-28 04:49:37,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2024-11-28 04:49:37,737 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2024-11-28 04:49:37,737 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2024-11-28 04:49:37,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-28 04:49:37,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:37,738 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:49:37,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2128418535, now seen corresponding path program 1 times [2024-11-28 04:49:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655765928] [2024-11-28 04:49:37,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:37,827 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-28 04:49:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:37,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655765928] [2024-11-28 04:49:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655765928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:37,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:37,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:37,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980998006] [2024-11-28 04:49:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:37,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:37,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:37,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:37,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-28 04:49:37,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-28 04:49:37,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:37,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-28 04:49:37,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:38,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][279], [Black: 493#true, 485#(= |#race~n2~0| 0), 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), 160#L100true, 509#true, Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), 491#(= |#race~count1~0| 0), Black: 505#true, Black: 489#true, 473#(= |#race~n1~0| 0)]) [2024-11-28 04:49:38,106 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-11-28 04:49:38,106 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-28 04:49:38,106 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2024-11-28 04:49:38,106 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-28 04:49:38,118 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2024-11-28 04:49:38,118 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2024-11-28 04:49:38,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4438 event pairs, 6 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2024-11-28 04:49:38,128 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-28 04:49:38,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2024-11-28 04:49:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-28 04:49:38,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-28 04:49:38,134 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2024-11-28 04:49:38,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2024-11-28 04:49:38,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:49:38,143 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2024-11-28 04:49:38,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2024-11-28 04:49:38,146 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-11-28 04:49:38,146 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2024-11-28 04:49:38,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-28 04:49:38,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:38,148 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:38,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:49:38,148 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:38,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash 311103630, now seen corresponding path program 1 times [2024-11-28 04:49:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:38,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043717496] [2024-11-28 04:49:38,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:38,247 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-28 04:49:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043717496] [2024-11-28 04:49:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043717496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:38,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:49:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972479524] [2024-11-28 04:49:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:38,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:38,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:38,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:38,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-28 04:49:38,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-28 04:49:38,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:38,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-28 04:49:38,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:38,513 INFO L124 PetriNetUnfolderBase]: 81/1037 cut-off events. [2024-11-28 04:49:38,513 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-11-28 04:49:38,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1037 events. 81/1037 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5358 event pairs, 12 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1194. Up to 86 conditions per place. [2024-11-28 04:49:38,526 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2024-11-28 04:49:38,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2024-11-28 04:49:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-28 04:49:38,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-11-28 04:49:38,531 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2024-11-28 04:49:38,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2024-11-28 04:49:38,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:38,543 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2024-11-28 04:49:38,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2024-11-28 04:49:38,544 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2024-11-28 04:49:38,545 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2024-11-28 04:49:38,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-28 04:49:38,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:38,546 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:38,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:49:38,546 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:38,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1377125406, now seen corresponding path program 1 times [2024-11-28 04:49:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485309786] [2024-11-28 04:49:38,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:38,637 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-28 04:49:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485309786] [2024-11-28 04:49:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485309786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:38,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:38,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:38,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239662468] [2024-11-28 04:49:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:38,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:38,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:38,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:38,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-28 04:49:38,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-28 04:49:38,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:38,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-28 04:49:38,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:39,012 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2024-11-28 04:49:39,013 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-11-28 04:49:39,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7238 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2024-11-28 04:49:39,027 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-28 04:49:39,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2024-11-28 04:49:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-28 04:49:39,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-28 04:49:39,033 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2024-11-28 04:49:39,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2024-11-28 04:49:39,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:39,045 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2024-11-28 04:49:39,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-11-28 04:49:39,047 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2024-11-28 04:49:39,047 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2024-11-28 04:49:39,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-28 04:49:39,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:39,049 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:49:39,049 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:39,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 928210612, now seen corresponding path program 1 times [2024-11-28 04:49:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500449463] [2024-11-28 04:49:39,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:39,404 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-28 04:49:39,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:39,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500449463] [2024-11-28 04:49:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500449463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:49:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289181392] [2024-11-28 04:49:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:49:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:39,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:49:39,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:49:40,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-28 04:49:40,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-28 04:49:40,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:40,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-28 04:49:40,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:40,676 INFO L124 PetriNetUnfolderBase]: 126/2072 cut-off events. [2024-11-28 04:49:40,676 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2024-11-28 04:49:40,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 2072 events. 126/2072 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14281 event pairs, 17 based on Foata normal form. 6/1858 useless extension candidates. Maximal degree in co-relation 2404. Up to 72 conditions per place. [2024-11-28 04:49:40,694 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 44 selfloop transitions, 19 changer transitions 0/439 dead transitions. [2024-11-28 04:49:40,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 439 transitions, 1077 flow [2024-11-28 04:49:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:49:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 04:49:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2024-11-28 04:49:40,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2024-11-28 04:49:40,709 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 12 states and 5200 transitions. [2024-11-28 04:49:40,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 439 transitions, 1077 flow [2024-11-28 04:49:40,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 439 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:40,722 INFO L231 Difference]: Finished difference. Result has 425 places, 422 transitions, 981 flow [2024-11-28 04:49:40,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=981, PETRI_PLACES=425, PETRI_TRANSITIONS=422} [2024-11-28 04:49:40,724 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-11-28 04:49:40,724 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 422 transitions, 981 flow [2024-11-28 04:49:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-28 04:49:40,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:40,726 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:40,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:49:40,727 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1184642240, now seen corresponding path program 1 times [2024-11-28 04:49:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916465853] [2024-11-28 04:49:40,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:40,826 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-28 04:49:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916465853] [2024-11-28 04:49:40,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916465853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:40,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:40,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136330473] [2024-11-28 04:49:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:40,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:40,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:40,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:40,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-28 04:49:40,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 422 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-28 04:49:40,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:40,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-28 04:49:40,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:41,357 INFO L124 PetriNetUnfolderBase]: 147/2144 cut-off events. [2024-11-28 04:49:41,357 INFO L125 PetriNetUnfolderBase]: For 55/59 co-relation queries the response was YES. [2024-11-28 04:49:41,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 2144 events. 147/2144 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 14693 event pairs, 12 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 2511. Up to 130 conditions per place. [2024-11-28 04:49:41,377 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 16 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-11-28 04:49:41,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 423 transitions, 1022 flow [2024-11-28 04:49:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2024-11-28 04:49:41,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9543859649122807 [2024-11-28 04:49:41,382 INFO L175 Difference]: Start difference. First operand has 425 places, 422 transitions, 981 flow. Second operand 3 states and 1360 transitions. [2024-11-28 04:49:41,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 423 transitions, 1022 flow [2024-11-28 04:49:41,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 1022 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:49:41,392 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2024-11-28 04:49:41,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2024-11-28 04:49:41,394 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2024-11-28 04:49:41,394 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2024-11-28 04:49:41,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-28 04:49:41,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:41,395 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:41,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:49:41,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:41,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -581395519, now seen corresponding path program 1 times [2024-11-28 04:49:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179331756] [2024-11-28 04:49:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:41,477 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-28 04:49:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179331756] [2024-11-28 04:49:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179331756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:41,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138758324] [2024-11-28 04:49:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:41,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:41,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:41,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-28 04:49:41,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-28 04:49:41,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:41,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-28 04:49:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:41,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][264], [Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), Black: 546#true, 491#(= |#race~count1~0| 0), Black: 489#true, 548#(= |#race~get2~0| 0), 550#true, 473#(= |#race~n1~0| 0), Black: 493#true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), 160#L100true, Black: 505#true, Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), 520#true, Black: 539#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|))]) [2024-11-28 04:49:41,889 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-11-28 04:49:41,889 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 04:49:41,889 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 04:49:41,889 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 04:49:41,901 INFO L124 PetriNetUnfolderBase]: 114/1636 cut-off events. [2024-11-28 04:49:41,901 INFO L125 PetriNetUnfolderBase]: For 56/63 co-relation queries the response was YES. [2024-11-28 04:49:41,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1636 events. 114/1636 cut-off events. For 56/63 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10101 event pairs, 10 based on Foata normal form. 0/1494 useless extension candidates. Maximal degree in co-relation 1952. Up to 96 conditions per place. [2024-11-28 04:49:41,917 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2024-11-28 04:49:41,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2024-11-28 04:49:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-28 04:49:41,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-28 04:49:41,922 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2024-11-28 04:49:41,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2024-11-28 04:49:41,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:49:41,932 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2024-11-28 04:49:41,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2024-11-28 04:49:41,933 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-11-28 04:49:41,933 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2024-11-28 04:49:41,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-28 04:49:41,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:41,935 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:41,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:49:41,935 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:41,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -173966554, now seen corresponding path program 1 times [2024-11-28 04:49:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:41,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400715542] [2024-11-28 04:49:41,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:42,275 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-28 04:49:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400715542] [2024-11-28 04:49:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400715542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:42,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:42,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:49:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089913515] [2024-11-28 04:49:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:42,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:49:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:42,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:49:42,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:49:42,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-28 04:49:42,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-28 04:49:42,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:42,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-28 04:49:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:43,363 INFO L124 PetriNetUnfolderBase]: 123/1434 cut-off events. [2024-11-28 04:49:43,363 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2024-11-28 04:49:43,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1434 events. 123/1434 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8385 event pairs, 18 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1838. Up to 124 conditions per place. [2024-11-28 04:49:43,378 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 46 selfloop transitions, 20 changer transitions 0/444 dead transitions. [2024-11-28 04:49:43,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 1186 flow [2024-11-28 04:49:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:49:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 04:49:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5202 transitions. [2024-11-28 04:49:43,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9126315789473685 [2024-11-28 04:49:43,392 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 12 states and 5202 transitions. [2024-11-28 04:49:43,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 1186 flow [2024-11-28 04:49:43,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 444 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:43,403 INFO L231 Difference]: Finished difference. Result has 438 places, 425 transitions, 1073 flow [2024-11-28 04:49:43,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1073, PETRI_PLACES=438, PETRI_TRANSITIONS=425} [2024-11-28 04:49:43,404 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 2 predicate places. [2024-11-28 04:49:43,404 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 425 transitions, 1073 flow [2024-11-28 04:49:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-28 04:49:43,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:43,407 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:43,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:49:43,408 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:43,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1093860148, now seen corresponding path program 1 times [2024-11-28 04:49:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:43,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190531714] [2024-11-28 04:49:43,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:43,707 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-28 04:49:43,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190531714] [2024-11-28 04:49:43,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190531714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:49:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200019184] [2024-11-28 04:49:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:43,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:49:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:43,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:49:43,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:49:44,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-28 04:49:44,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 425 transitions, 1073 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-28 04:49:44,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:44,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-28 04:49:44,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:45,427 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2024-11-28 04:49:45,427 INFO L125 PetriNetUnfolderBase]: For 255/284 co-relation queries the response was YES. [2024-11-28 04:49:45,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2781 events. 189/2781 cut-off events. For 255/284 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20663 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3671. Up to 129 conditions per place. [2024-11-28 04:49:45,450 INFO L140 encePairwiseOnDemand]: 459/475 looper letters, 50 selfloop transitions, 21 changer transitions 0/450 dead transitions. [2024-11-28 04:49:45,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 450 transitions, 1318 flow [2024-11-28 04:49:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:49:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 04:49:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2024-11-28 04:49:45,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.911578947368421 [2024-11-28 04:49:45,463 INFO L175 Difference]: Start difference. First operand has 438 places, 425 transitions, 1073 flow. Second operand 11 states and 4763 transitions. [2024-11-28 04:49:45,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 450 transitions, 1318 flow [2024-11-28 04:49:45,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 450 transitions, 1301 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 04:49:45,477 INFO L231 Difference]: Finished difference. Result has 447 places, 439 transitions, 1210 flow [2024-11-28 04:49:45,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=447, PETRI_TRANSITIONS=439} [2024-11-28 04:49:45,478 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 11 predicate places. [2024-11-28 04:49:45,479 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 439 transitions, 1210 flow [2024-11-28 04:49:45,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-28 04:49:45,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:45,480 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:45,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 04:49:45,481 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2119970622, now seen corresponding path program 1 times [2024-11-28 04:49:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:45,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762751588] [2024-11-28 04:49:45,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:45,829 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-28 04:49:45,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762751588] [2024-11-28 04:49:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762751588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:49:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711346559] [2024-11-28 04:49:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:45,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:49:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:45,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:49:45,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:49:46,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-28 04:49:46,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 439 transitions, 1210 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-28 04:49:46,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:46,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-28 04:49:46,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:47,145 INFO L124 PetriNetUnfolderBase]: 162/1951 cut-off events. [2024-11-28 04:49:47,146 INFO L125 PetriNetUnfolderBase]: For 329/334 co-relation queries the response was YES. [2024-11-28 04:49:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1951 events. 162/1951 cut-off events. For 329/334 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12784 event pairs, 25 based on Foata normal form. 8/1815 useless extension candidates. Maximal degree in co-relation 2732. Up to 164 conditions per place. [2024-11-28 04:49:47,166 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 44 selfloop transitions, 25 changer transitions 0/456 dead transitions. [2024-11-28 04:49:47,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 1425 flow [2024-11-28 04:49:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:49:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 04:49:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2024-11-28 04:49:47,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107017543859649 [2024-11-28 04:49:47,178 INFO L175 Difference]: Start difference. First operand has 447 places, 439 transitions, 1210 flow. Second operand 12 states and 5191 transitions. [2024-11-28 04:49:47,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 1425 flow [2024-11-28 04:49:47,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 456 transitions, 1421 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:49:47,196 INFO L231 Difference]: Finished difference. Result has 461 places, 448 transitions, 1351 flow [2024-11-28 04:49:47,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1351, PETRI_PLACES=461, PETRI_TRANSITIONS=448} [2024-11-28 04:49:47,198 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 25 predicate places. [2024-11-28 04:49:47,198 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 448 transitions, 1351 flow [2024-11-28 04:49:47,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-28 04:49:47,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:47,199 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:47,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 04:49:47,200 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1505037422, now seen corresponding path program 1 times [2024-11-28 04:49:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391028307] [2024-11-28 04:49:47,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:47,282 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-28 04:49:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:47,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391028307] [2024-11-28 04:49:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391028307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:47,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:49:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284142951] [2024-11-28 04:49:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:47,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:47,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:47,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:47,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-28 04:49:47,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 448 transitions, 1351 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-28 04:49:47,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:47,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-28 04:49:47,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:48,010 INFO L124 PetriNetUnfolderBase]: 145/2656 cut-off events. [2024-11-28 04:49:48,011 INFO L125 PetriNetUnfolderBase]: For 584/591 co-relation queries the response was YES. [2024-11-28 04:49:48,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 2656 events. 145/2656 cut-off events. For 584/591 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19390 event pairs, 17 based on Foata normal form. 1/2463 useless extension candidates. Maximal degree in co-relation 3601. Up to 77 conditions per place. [2024-11-28 04:49:48,036 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 15 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2024-11-28 04:49:48,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 453 transitions, 1398 flow [2024-11-28 04:49:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2024-11-28 04:49:48,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628070175438597 [2024-11-28 04:49:48,039 INFO L175 Difference]: Start difference. First operand has 461 places, 448 transitions, 1351 flow. Second operand 3 states and 1372 transitions. [2024-11-28 04:49:48,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 453 transitions, 1398 flow [2024-11-28 04:49:48,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 453 transitions, 1381 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 04:49:48,056 INFO L231 Difference]: Finished difference. Result has 459 places, 450 transitions, 1354 flow [2024-11-28 04:49:48,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=459, PETRI_TRANSITIONS=450} [2024-11-28 04:49:48,057 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 23 predicate places. [2024-11-28 04:49:48,057 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 450 transitions, 1354 flow [2024-11-28 04:49:48,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-28 04:49:48,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:48,058 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:48,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 04:49:48,059 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash 337741008, now seen corresponding path program 2 times [2024-11-28 04:49:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464399863] [2024-11-28 04:49:48,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:49:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:48,087 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:49:48,087 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:49:48,135 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-28 04:49:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464399863] [2024-11-28 04:49:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464399863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:49:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240919254] [2024-11-28 04:49:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:48,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:48,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:48,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:48,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-28 04:49:48,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 450 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-28 04:49:48,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:48,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-28 04:49:48,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:48,735 INFO L124 PetriNetUnfolderBase]: 139/2631 cut-off events. [2024-11-28 04:49:48,735 INFO L125 PetriNetUnfolderBase]: For 757/777 co-relation queries the response was YES. [2024-11-28 04:49:48,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 2631 events. 139/2631 cut-off events. For 757/777 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19154 event pairs, 13 based on Foata normal form. 13/2478 useless extension candidates. Maximal degree in co-relation 3720. Up to 72 conditions per place. [2024-11-28 04:49:48,760 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 17 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2024-11-28 04:49:48,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 455 transitions, 1409 flow [2024-11-28 04:49:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2024-11-28 04:49:48,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628070175438597 [2024-11-28 04:49:48,763 INFO L175 Difference]: Start difference. First operand has 459 places, 450 transitions, 1354 flow. Second operand 3 states and 1372 transitions. [2024-11-28 04:49:48,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 455 transitions, 1409 flow [2024-11-28 04:49:48,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 455 transitions, 1407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:49:48,782 INFO L231 Difference]: Finished difference. Result has 462 places, 452 transitions, 1376 flow [2024-11-28 04:49:48,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1376, PETRI_PLACES=462, PETRI_TRANSITIONS=452} [2024-11-28 04:49:48,784 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 26 predicate places. [2024-11-28 04:49:48,784 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 452 transitions, 1376 flow [2024-11-28 04:49:48,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-28 04:49:48,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:48,785 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:48,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 04:49:48,785 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1804640435, now seen corresponding path program 1 times [2024-11-28 04:49:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022110123] [2024-11-28 04:49:48,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:48,851 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-28 04:49:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022110123] [2024-11-28 04:49:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022110123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26110788] [2024-11-28 04:49:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:48,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:48,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:48,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:48,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-28 04:49:48,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 452 transitions, 1376 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:48,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:48,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-28 04:49:48,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:49,395 INFO L124 PetriNetUnfolderBase]: 126/2491 cut-off events. [2024-11-28 04:49:49,395 INFO L125 PetriNetUnfolderBase]: For 645/687 co-relation queries the response was YES. [2024-11-28 04:49:49,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 2491 events. 126/2491 cut-off events. For 645/687 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 17810 event pairs, 10 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 3571. Up to 74 conditions per place. [2024-11-28 04:49:49,416 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 12 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2024-11-28 04:49:49,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 449 transitions, 1396 flow [2024-11-28 04:49:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2024-11-28 04:49:49,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952280701754386 [2024-11-28 04:49:49,418 INFO L175 Difference]: Start difference. First operand has 462 places, 452 transitions, 1376 flow. Second operand 3 states and 1357 transitions. [2024-11-28 04:49:49,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 449 transitions, 1396 flow [2024-11-28 04:49:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 449 transitions, 1390 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-28 04:49:49,435 INFO L231 Difference]: Finished difference. Result has 460 places, 449 transitions, 1366 flow [2024-11-28 04:49:49,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=460, PETRI_TRANSITIONS=449} [2024-11-28 04:49:49,436 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 24 predicate places. [2024-11-28 04:49:49,437 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 449 transitions, 1366 flow [2024-11-28 04:49:49,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:49,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:49,437 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:49,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 04:49:49,438 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:49,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1697462071, now seen corresponding path program 1 times [2024-11-28 04:49:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:49,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292158435] [2024-11-28 04:49:49,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:49,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:49,492 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-28 04:49:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292158435] [2024-11-28 04:49:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292158435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109289820] [2024-11-28 04:49:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:49,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-28 04:49:49,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 449 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:49,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:49,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-28 04:49:49,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:50,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][272], [Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 553#true, Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 639#true, 491#(= |#race~count1~0| 0), 602#true, 473#(= |#race~n1~0| 0), 633#(= ~count2~0 ~count1~0), Black: 588#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 582#(<= ~n2~0 0), Black: 583#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 590#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 596#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), Black: 539#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, 548#(= |#race~get2~0| 0), Black: 608#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n2~0 0)), Black: 621#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n2~0 0)), Black: 493#true, Black: 607#(<= ~n2~0 0), Black: 628#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), 160#L100true, Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 631#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 636#true, 520#true, Black: 558#(<= ~n1~0 0)]) [2024-11-28 04:49:50,059 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-11-28 04:49:50,059 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2024-11-28 04:49:50,059 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-28 04:49:50,059 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-28 04:49:50,069 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2024-11-28 04:49:50,069 INFO L125 PetriNetUnfolderBase]: For 494/520 co-relation queries the response was YES. [2024-11-28 04:49:50,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 2358 events. 128/2358 cut-off events. For 494/520 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16566 event pairs, 10 based on Foata normal form. 9/2240 useless extension candidates. Maximal degree in co-relation 3303. Up to 99 conditions per place. [2024-11-28 04:49:50,088 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 6 selfloop transitions, 0 changer transitions 87/448 dead transitions. [2024-11-28 04:49:50,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 448 transitions, 1392 flow [2024-11-28 04:49:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:50,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:50,090 INFO L175 Difference]: Start difference. First operand has 460 places, 449 transitions, 1366 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:50,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 448 transitions, 1392 flow [2024-11-28 04:49:50,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 448 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:49:50,105 INFO L231 Difference]: Finished difference. Result has 458 places, 361 transitions, 945 flow [2024-11-28 04:49:50,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=945, PETRI_PLACES=458, PETRI_TRANSITIONS=361} [2024-11-28 04:49:50,107 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2024-11-28 04:49:50,107 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 361 transitions, 945 flow [2024-11-28 04:49:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-28 04:49:50,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:50,108 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:50,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 04:49:50,109 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash 913922644, now seen corresponding path program 1 times [2024-11-28 04:49:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630005900] [2024-11-28 04:49:50,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:49:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630005900] [2024-11-28 04:49:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630005900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:49:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176200626] [2024-11-28 04:49:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:49:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:50,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:49:50,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:49:51,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-28 04:49:51,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 361 transitions, 945 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-28 04:49:51,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:51,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-28 04:49:51,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:52,158 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2024-11-28 04:49:52,158 INFO L125 PetriNetUnfolderBase]: For 287/288 co-relation queries the response was YES. [2024-11-28 04:49:52,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 1368 events. 85/1368 cut-off events. For 287/288 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8453 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2004. Up to 42 conditions per place. [2024-11-28 04:49:52,169 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2024-11-28 04:49:52,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 364 transitions, 1021 flow [2024-11-28 04:49:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:49:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 04:49:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-28 04:49:52,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-28 04:49:52,173 INFO L175 Difference]: Start difference. First operand has 458 places, 361 transitions, 945 flow. Second operand 6 states and 2637 transitions. [2024-11-28 04:49:52,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 364 transitions, 1021 flow [2024-11-28 04:49:52,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 364 transitions, 915 flow, removed 22 selfloop flow, removed 28 redundant places. [2024-11-28 04:49:52,183 INFO L231 Difference]: Finished difference. Result has 375 places, 360 transitions, 858 flow [2024-11-28 04:49:52,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=858, PETRI_PLACES=375, PETRI_TRANSITIONS=360} [2024-11-28 04:49:52,185 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -61 predicate places. [2024-11-28 04:49:52,185 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 360 transitions, 858 flow [2024-11-28 04:49:52,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-28 04:49:52,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:52,190 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:52,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 04:49:52,190 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:52,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 285490886, now seen corresponding path program 1 times [2024-11-28 04:49:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57089718] [2024-11-28 04:49:52,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:49:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57089718] [2024-11-28 04:49:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57089718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:49:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141067295] [2024-11-28 04:49:52,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:49:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:49:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:49:53,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-28 04:49:53,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 360 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-28 04:49:53,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:53,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-28 04:49:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:54,168 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2024-11-28 04:49:54,168 INFO L125 PetriNetUnfolderBase]: For 114/117 co-relation queries the response was YES. [2024-11-28 04:49:54,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1146 events. 89/1146 cut-off events. For 114/117 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6508 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1529. Up to 66 conditions per place. [2024-11-28 04:49:54,178 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2024-11-28 04:49:54,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 363 transitions, 930 flow [2024-11-28 04:49:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:49:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 04:49:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-28 04:49:54,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-28 04:49:54,183 INFO L175 Difference]: Start difference. First operand has 375 places, 360 transitions, 858 flow. Second operand 6 states and 2637 transitions. [2024-11-28 04:49:54,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 363 transitions, 930 flow [2024-11-28 04:49:54,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 363 transitions, 921 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 04:49:54,191 INFO L231 Difference]: Finished difference. Result has 375 places, 359 transitions, 864 flow [2024-11-28 04:49:54,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=375, PETRI_TRANSITIONS=359} [2024-11-28 04:49:54,194 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -61 predicate places. [2024-11-28 04:49:54,195 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 359 transitions, 864 flow [2024-11-28 04:49:54,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-28 04:49:54,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:54,196 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 04:49:54,197 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1120125434, now seen corresponding path program 1 times [2024-11-28 04:49:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852616858] [2024-11-28 04:49:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:49:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852616858] [2024-11-28 04:49:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852616858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:49:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014907000] [2024-11-28 04:49:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:54,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:49:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:54,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:49:54,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:49:55,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-28 04:49:55,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 359 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-28 04:49:55,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:55,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-28 04:49:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:55,819 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2024-11-28 04:49:55,819 INFO L125 PetriNetUnfolderBase]: For 110/111 co-relation queries the response was YES. [2024-11-28 04:49:55,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 1333 events. 79/1333 cut-off events. For 110/111 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8037 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1756. Up to 42 conditions per place. [2024-11-28 04:49:55,828 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2024-11-28 04:49:55,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 361 transitions, 934 flow [2024-11-28 04:49:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:49:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 04:49:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-28 04:49:55,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-28 04:49:55,831 INFO L175 Difference]: Start difference. First operand has 375 places, 359 transitions, 864 flow. Second operand 6 states and 2637 transitions. [2024-11-28 04:49:55,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 361 transitions, 934 flow [2024-11-28 04:49:55,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 361 transitions, 925 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 04:49:55,841 INFO L231 Difference]: Finished difference. Result has 374 places, 357 transitions, 863 flow [2024-11-28 04:49:55,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=863, PETRI_PLACES=374, PETRI_TRANSITIONS=357} [2024-11-28 04:49:55,842 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2024-11-28 04:49:55,842 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 357 transitions, 863 flow [2024-11-28 04:49:55,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-28 04:49:55,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:55,844 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 04:49:55,844 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:55,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -404087572, now seen corresponding path program 1 times [2024-11-28 04:49:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117160761] [2024-11-28 04:49:55,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:49:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117160761] [2024-11-28 04:49:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117160761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:56,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:56,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:49:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790329350] [2024-11-28 04:49:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:56,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:49:56,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:56,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:49:56,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:49:57,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-28 04:49:57,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 357 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-28 04:49:57,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:57,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-28 04:49:57,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:57,454 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2024-11-28 04:49:57,455 INFO L125 PetriNetUnfolderBase]: For 136/139 co-relation queries the response was YES. [2024-11-28 04:49:57,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1120 events. 84/1120 cut-off events. For 136/139 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6152 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1509. Up to 61 conditions per place. [2024-11-28 04:49:57,463 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2024-11-28 04:49:57,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 359 transitions, 933 flow [2024-11-28 04:49:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:49:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 04:49:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-28 04:49:57,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-28 04:49:57,467 INFO L175 Difference]: Start difference. First operand has 374 places, 357 transitions, 863 flow. Second operand 6 states and 2637 transitions. [2024-11-28 04:49:57,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 359 transitions, 933 flow [2024-11-28 04:49:57,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 359 transitions, 921 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 04:49:57,476 INFO L231 Difference]: Finished difference. Result has 372 places, 355 transitions, 859 flow [2024-11-28 04:49:57,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=372, PETRI_TRANSITIONS=355} [2024-11-28 04:49:57,477 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -64 predicate places. [2024-11-28 04:49:57,477 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 355 transitions, 859 flow [2024-11-28 04:49:57,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-28 04:49:57,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:57,479 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:57,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 04:49:57,479 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1621447331, now seen corresponding path program 1 times [2024-11-28 04:49:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454202241] [2024-11-28 04:49:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:49:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454202241] [2024-11-28 04:49:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454202241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:57,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743181677] [2024-11-28 04:49:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:57,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:57,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:57,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:57,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-28 04:49:57,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 355 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-28 04:49:57,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:57,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-28 04:49:57,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:57,848 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2024-11-28 04:49:57,848 INFO L125 PetriNetUnfolderBase]: For 100/103 co-relation queries the response was YES. [2024-11-28 04:49:57,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 1173 events. 66/1173 cut-off events. For 100/103 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6312 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1499. Up to 36 conditions per place. [2024-11-28 04:49:57,859 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-11-28 04:49:57,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 355 transitions, 878 flow [2024-11-28 04:49:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2024-11-28 04:49:57,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952280701754386 [2024-11-28 04:49:57,862 INFO L175 Difference]: Start difference. First operand has 372 places, 355 transitions, 859 flow. Second operand 3 states and 1357 transitions. [2024-11-28 04:49:57,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 355 transitions, 878 flow [2024-11-28 04:49:57,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 355 transitions, 866 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 04:49:57,870 INFO L231 Difference]: Finished difference. Result has 368 places, 354 transitions, 849 flow [2024-11-28 04:49:57,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=368, PETRI_TRANSITIONS=354} [2024-11-28 04:49:57,872 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -68 predicate places. [2024-11-28 04:49:57,872 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 354 transitions, 849 flow [2024-11-28 04:49:57,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-28 04:49:57,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:49:57,873 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:49:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 04:49:57,873 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-28 04:49:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1021095806, now seen corresponding path program 1 times [2024-11-28 04:49:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257813125] [2024-11-28 04:49:57,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:49:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257813125] [2024-11-28 04:49:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257813125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660220739] [2024-11-28 04:49:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:57,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:57,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:58,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-28 04:49:58,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 354 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-28 04:49:58,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:49:58,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-28 04:49:58,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:49:58,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1225] L77-6-->L77-7: Formula: (= |v_#race~res2~0_7| |v_thread2Thread1of1ForFork1_#t~nondet17_3|) InVars {thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} OutVars{#race~res2~0=|v_#race~res2~0_7|, thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} AuxVars[] AssignedVars[#race~res2~0][264], [553#true, Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 639#true, Black: 647#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 671#true, 491#(= |#race~count1~0| 0), 602#true, 473#(= |#race~n1~0| 0), Black: 654#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 633#(= ~count2~0 ~count1~0), Black: 588#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 668#true, Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, 36#L99-1true, Black: 489#true, 548#(= |#race~get2~0| 0), Black: 493#true, Black: 628#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), 309#L77-7true, Black: 631#true, Black: 505#true, 520#true]) [2024-11-28 04:49:58,217 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2024-11-28 04:49:58,217 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-28 04:49:58,217 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-28 04:49:58,217 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-28 04:49:58,217 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2024-11-28 04:49:58,217 INFO L125 PetriNetUnfolderBase]: For 81/84 co-relation queries the response was YES. [2024-11-28 04:49:58,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1014 events. 65/1014 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4953 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1286. Up to 44 conditions per place. [2024-11-28 04:49:58,223 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2024-11-28 04:49:58,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 354 transitions, 870 flow [2024-11-28 04:49:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:49:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-28 04:49:58,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-28 04:49:58,227 INFO L175 Difference]: Start difference. First operand has 368 places, 354 transitions, 849 flow. Second operand 3 states and 1358 transitions. [2024-11-28 04:49:58,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 354 transitions, 870 flow [2024-11-28 04:49:58,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 354 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:49:58,233 INFO L231 Difference]: Finished difference. Result has 367 places, 0 transitions, 0 flow [2024-11-28 04:49:58,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=367, PETRI_TRANSITIONS=0} [2024-11-28 04:49:58,234 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2024-11-28 04:49:58,234 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 0 transitions, 0 flow [2024-11-28 04:49:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-28 04:49:58,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-11-28 04:49:58,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-11-28 04:49:58,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-11-28 04:49:58,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-11-28 04:49:58,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-11-28 04:49:58,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-11-28 04:49:58,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-11-28 04:49:58,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-11-28 04:49:58,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-11-28 04:49:58,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-11-28 04:49:58,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-11-28 04:49:58,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-11-28 04:49:58,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-11-28 04:49:58,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-11-28 04:49:58,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-11-28 04:49:58,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-11-28 04:49:58,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-11-28 04:49:58,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-11-28 04:49:58,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-11-28 04:49:58,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-11-28 04:49:58,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-11-28 04:49:58,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-11-28 04:49:58,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-11-28 04:49:58,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-11-28 04:49:58,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-11-28 04:49:58,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-11-28 04:49:58,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-11-28 04:49:58,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 04:49:58,251 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2024-11-28 04:49:58,261 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 04:49:58,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:49:58,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:49:58 BasicIcfg [2024-11-28 04:49:58,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:49:58,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:49:58,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:49:58,276 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:49:58,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:28" (3/4) ... [2024-11-28 04:49:58,279 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:49:58,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 04:49:58,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 04:49:58,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-28 04:49:58,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 04:49:58,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:49:58,296 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 04:49:58,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:49:58,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:49:58,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:49:58,416 INFO L158 Benchmark]: Toolchain (without parser) took 32519.10ms. Allocated memory was 117.4MB in the beginning and 461.4MB in the end (delta: 343.9MB). Free memory was 92.4MB in the beginning and 397.9MB in the end (delta: -305.4MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-28 04:49:58,417 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:49:58,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.61ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.0MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:49:58,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.26ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:49:58,419 INFO L158 Benchmark]: Boogie Preprocessor took 68.52ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:49:58,420 INFO L158 Benchmark]: RCFGBuilder took 1584.15ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 40.5MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 04:49:58,421 INFO L158 Benchmark]: TraceAbstraction took 30161.03ms. Allocated memory was 117.4MB in the beginning and 461.4MB in the end (delta: 343.9MB). Free memory was 40.0MB in the beginning and 402.1MB in the end (delta: -362.1MB). Peak memory consumption was 239.8MB. Max. memory is 16.1GB. [2024-11-28 04:49:58,421 INFO L158 Benchmark]: Witness Printer took 138.76ms. Allocated memory is still 461.4MB. Free memory was 402.1MB in the beginning and 397.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:49:58,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.61ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.0MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.26ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.52ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1584.15ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 40.5MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30161.03ms. Allocated memory was 117.4MB in the beginning and 461.4MB in the end (delta: 343.9MB). Free memory was 40.0MB in the beginning and 402.1MB in the end (delta: -362.1MB). Peak memory consumption was 239.8MB. Max. memory is 16.1GB. * Witness Printer took 138.76ms. Allocated memory is still 461.4MB. Free memory was 402.1MB in the beginning and 397.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 668 locations, 94 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.8s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3927 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2403 mSDsluCounter, 3844 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3588 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5616 IncrementalHoareTripleChecker+Invalid, 6252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 256 mSDtfsCounter, 5616 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1376occurred in iteration=25, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4403 ConstructedInterpolants, 0 QuantifiedInterpolants, 5751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 04:49:58,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68d7e0a-7c6d-440e-91d3-ec906e594aa1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE