./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-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_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/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_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/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_22c5e9b0-efc9-4809-a072-fce2aad1da45/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 e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:33:56,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:33:56,978 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-27 23:33:56,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:33:56,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:33:57,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:33:57,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:33:57,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:33:57,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:33:57,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:33:57,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:33:57,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:33:57,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:33:57,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:33:57,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:33:57,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:33:57,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:33:57,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:33:57,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:33:57,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:33:57,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:33:57,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:33:57,053 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-27 23:33:57,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:33:57,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:33:57,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:33:57,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:33:57,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:33:57,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:33:57,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:33:57,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:33:57,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:33:57,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:33:57,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:33:57,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:33:57,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:33:57,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:33:57,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:33:57,056 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_22c5e9b0-efc9-4809-a072-fce2aad1da45/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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2024-11-27 23:33:57,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:33:57,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:33:57,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:33:57,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:33:57,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:33:57,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-11-27 23:34:01,469 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/data/a61b67927/98d8193f81b245728b715eed262e2cc3/FLAGfac6cd592 [2024-11-27 23:34:01,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:34:01,780 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-11-27 23:34:01,790 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/data/a61b67927/98d8193f81b245728b715eed262e2cc3/FLAGfac6cd592 [2024-11-27 23:34:01,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/data/a61b67927/98d8193f81b245728b715eed262e2cc3 [2024-11-27 23:34:01,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:34:01,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:34:01,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:34:01,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:34:01,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:34:01,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:34:01" (1/1) ... [2024-11-27 23:34:01,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508b877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:01, skipping insertion in model container [2024-11-27 23:34:01,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:34:01" (1/1) ... [2024-11-27 23:34:01,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:34:02,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:34:02,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:34:02,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:34:02,224 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:34:02,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02 WrapperNode [2024-11-27 23:34:02,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:34:02,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:34:02,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:34:02,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:34:02,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,299 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 587 [2024-11-27 23:34:02,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:34:02,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:34:02,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:34:02,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:34:02,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:34:02,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:34:02,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:34:02,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:34:02,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (1/1) ... [2024-11-27 23:34:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:34:02,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:34:02,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:34:02,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:34:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:34:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-27 23:34:02,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-27 23:34:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-27 23:34:02,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-27 23:34:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 23:34:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-27 23:34:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:34:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:34:02,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:34:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-27 23:34:02,452 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 23:34:02,648 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:34:02,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:34:04,047 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 23:34:04,048 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:34:04,091 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:34:04,092 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-27 23:34:04,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:34:04 BoogieIcfgContainer [2024-11-27 23:34:04,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:34:04,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:34:04,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:34:04,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:34:04,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:34:01" (1/3) ... [2024-11-27 23:34:04,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fc5771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:34:04, skipping insertion in model container [2024-11-27 23:34:04,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:34:02" (2/3) ... [2024-11-27 23:34:04,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fc5771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:34:04, skipping insertion in model container [2024-11-27 23:34:04,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:34:04" (3/3) ... [2024-11-27 23:34:04,107 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2024-11-27 23:34:04,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:34:04,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 734 locations, 1 initial locations, 3 loop locations, and 102 error locations. [2024-11-27 23:34:04,130 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 23:34:04,492 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-27 23:34:04,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 740 places, 774 transitions, 1562 flow [2024-11-27 23:34:05,142 INFO L124 PetriNetUnfolderBase]: 41/772 cut-off events. [2024-11-27 23:34:05,145 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-27 23:34:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 772 events. 41/772 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2013 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2024-11-27 23:34:05,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 774 transitions, 1562 flow [2024-11-27 23:34:05,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 750 transitions, 1512 flow [2024-11-27 23:34:05,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:34:05,222 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;@43aecb16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:34:05,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2024-11-27 23:34:05,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:34:05,232 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-27 23:34:05,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:34:05,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:05,233 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] [2024-11-27 23:34:05,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash -383353773, now seen corresponding path program 1 times [2024-11-27 23:34:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909318499] [2024-11-27 23:34:05,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:05,464 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-27 23:34:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909318499] [2024-11-27 23:34:05,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909318499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:05,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:05,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:05,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791449914] [2024-11-27 23:34:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:05,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:05,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:05,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:05,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:05,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 750 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:05,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:05,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:05,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:06,682 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-11-27 23:34:06,683 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2024-11-27 23:34:06,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 2402 events. 133/2402 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15134 event pairs, 35 based on Foata normal form. 66/1971 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2024-11-27 23:34:06,724 INFO L140 encePairwiseOnDemand]: 758/774 looper letters, 17 selfloop transitions, 2 changer transitions 2/736 dead transitions. [2024-11-27 23:34:06,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1522 flow [2024-11-27 23:34:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-11-27 23:34:06,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677002583979328 [2024-11-27 23:34:06,760 INFO L175 Difference]: Start difference. First operand has 718 places, 750 transitions, 1512 flow. Second operand 3 states and 2247 transitions. [2024-11-27 23:34:06,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1522 flow [2024-11-27 23:34:06,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 736 transitions, 1514 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-27 23:34:06,848 INFO L231 Difference]: Finished difference. Result has 715 places, 734 transitions, 1476 flow [2024-11-27 23:34:06,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=715, PETRI_TRANSITIONS=734} [2024-11-27 23:34:06,861 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -3 predicate places. [2024-11-27 23:34:06,864 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 734 transitions, 1476 flow [2024-11-27 23:34:06,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:06,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:06,868 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] [2024-11-27 23:34:06,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:34:06,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash -478582244, now seen corresponding path program 1 times [2024-11-27 23:34:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267943600] [2024-11-27 23:34:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:07,022 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-27 23:34:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267943600] [2024-11-27 23:34:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267943600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468588044] [2024-11-27 23:34:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:07,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:07,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:07,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:07,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:07,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:07,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:07,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:07,994 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-11-27 23:34:07,994 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-27 23:34:08,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2402 events. 133/2402 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14664 event pairs, 35 based on Foata normal form. 0/1902 useless extension candidates. Maximal degree in co-relation 2467. Up to 88 conditions per place. [2024-11-27 23:34:08,038 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2024-11-27 23:34:08,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2024-11-27 23:34:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-11-27 23:34:08,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-11-27 23:34:08,050 INFO L175 Difference]: Start difference. First operand has 715 places, 734 transitions, 1476 flow. Second operand 3 states and 2234 transitions. [2024-11-27 23:34:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2024-11-27 23:34:08,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:08,067 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2024-11-27 23:34:08,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2024-11-27 23:34:08,069 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -6 predicate places. [2024-11-27 23:34:08,070 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2024-11-27 23:34:08,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:08,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:08,072 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] [2024-11-27 23:34:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:34:08,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2055330758, now seen corresponding path program 1 times [2024-11-27 23:34:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837511835] [2024-11-27 23:34:08,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:08,194 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-27 23:34:08,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837511835] [2024-11-27 23:34:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837511835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421089164] [2024-11-27 23:34:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:08,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:08,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:08,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:08,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:08,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:08,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:08,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:08,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:08,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:09,247 INFO L124 PetriNetUnfolderBase]: 130/2940 cut-off events. [2024-11-27 23:34:09,248 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-27 23:34:09,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2940 events. 130/2940 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17874 event pairs, 8 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 2946. Up to 34 conditions per place. [2024-11-27 23:34:09,284 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-11-27 23:34:09,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1510 flow [2024-11-27 23:34:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-11-27 23:34:09,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-11-27 23:34:09,296 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2234 transitions. [2024-11-27 23:34:09,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1510 flow [2024-11-27 23:34:09,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:09,319 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2024-11-27 23:34:09,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2024-11-27 23:34:09,322 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -7 predicate places. [2024-11-27 23:34:09,324 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2024-11-27 23:34:09,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:09,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:09,326 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-27 23:34:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:34:09,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:09,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash 510051914, now seen corresponding path program 1 times [2024-11-27 23:34:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:09,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038002370] [2024-11-27 23:34:09,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:09,431 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-27 23:34:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038002370] [2024-11-27 23:34:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038002370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016750005] [2024-11-27 23:34:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:09,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:09,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-11-27 23:34:09,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:34:09,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:09,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-11-27 23:34:09,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:09,966 INFO L124 PetriNetUnfolderBase]: 44/1006 cut-off events. [2024-11-27 23:34:09,966 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-27 23:34:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 1006 events. 44/1006 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3888 event pairs, 6 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 994. Up to 26 conditions per place. [2024-11-27 23:34:09,997 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-11-27 23:34:09,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1500 flow [2024-11-27 23:34:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-27 23:34:10,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-11-27 23:34:10,008 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2242 transitions. [2024-11-27 23:34:10,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1500 flow [2024-11-27 23:34:10,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:10,030 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2024-11-27 23:34:10,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2024-11-27 23:34:10,035 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -8 predicate places. [2024-11-27 23:34:10,035 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2024-11-27 23:34:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:34:10,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:10,038 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] [2024-11-27 23:34:10,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:34:10,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:10,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:10,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1011653337, now seen corresponding path program 1 times [2024-11-27 23:34:10,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:10,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712052880] [2024-11-27 23:34:10,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:10,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:10,183 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-27 23:34:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:10,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712052880] [2024-11-27 23:34:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712052880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:10,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:10,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444249987] [2024-11-27 23:34:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:10,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:10,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:10,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:10,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-27 23:34:10,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-27 23:34:10,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:10,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-27 23:34:10,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:10,929 INFO L124 PetriNetUnfolderBase]: 91/2110 cut-off events. [2024-11-27 23:34:10,929 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-11-27 23:34:10,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 2110 events. 91/2110 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10571 event pairs, 5 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2086. Up to 23 conditions per place. [2024-11-27 23:34:10,957 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-11-27 23:34:10,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1496 flow [2024-11-27 23:34:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-11-27 23:34:10,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-11-27 23:34:10,964 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2244 transitions. [2024-11-27 23:34:10,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1496 flow [2024-11-27 23:34:10,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:10,977 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2024-11-27 23:34:10,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2024-11-27 23:34:10,981 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -9 predicate places. [2024-11-27 23:34:10,982 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2024-11-27 23:34:10,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-27 23:34:10,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:10,984 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] [2024-11-27 23:34:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:34:10,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1429325745, now seen corresponding path program 1 times [2024-11-27 23:34:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555691159] [2024-11-27 23:34:10,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:11,121 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-27 23:34:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555691159] [2024-11-27 23:34:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555691159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496668259] [2024-11-27 23:34:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:11,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:11,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:11,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:11,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-11-27 23:34:11,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-27 23:34:11,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:11,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-11-27 23:34:11,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:12,249 INFO L124 PetriNetUnfolderBase]: 182/4041 cut-off events. [2024-11-27 23:34:12,249 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-27 23:34:12,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 4041 events. 182/4041 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 28046 event pairs, 12 based on Foata normal form. 0/3194 useless extension candidates. Maximal degree in co-relation 4037. Up to 44 conditions per place. [2024-11-27 23:34:12,284 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-11-27 23:34:12,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1508 flow [2024-11-27 23:34:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-11-27 23:34:12,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-11-27 23:34:12,292 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2024-11-27 23:34:12,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1508 flow [2024-11-27 23:34:12,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:12,305 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2024-11-27 23:34:12,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2024-11-27 23:34:12,309 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -10 predicate places. [2024-11-27 23:34:12,310 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2024-11-27 23:34:12,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-27 23:34:12,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:12,313 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] [2024-11-27 23:34:12,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:34:12,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 765645851, now seen corresponding path program 1 times [2024-11-27 23:34:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:12,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224661295] [2024-11-27 23:34:12,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:12,405 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-27 23:34:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224661295] [2024-11-27 23:34:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224661295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493805033] [2024-11-27 23:34:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:12,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:12,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:12,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:12,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:12,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:12,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:12,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:12,802 INFO L124 PetriNetUnfolderBase]: 46/987 cut-off events. [2024-11-27 23:34:12,803 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-11-27 23:34:12,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 987 events. 46/987 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3791 event pairs, 8 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 954. Up to 35 conditions per place. [2024-11-27 23:34:12,824 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-11-27 23:34:12,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1502 flow [2024-11-27 23:34:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-11-27 23:34:12,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-11-27 23:34:12,831 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2234 transitions. [2024-11-27 23:34:12,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1502 flow [2024-11-27 23:34:12,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:12,845 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2024-11-27 23:34:12,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2024-11-27 23:34:12,848 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -11 predicate places. [2024-11-27 23:34:12,848 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2024-11-27 23:34:12,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-27 23:34:12,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:12,850 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] [2024-11-27 23:34:12,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:34:12,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2129862914, now seen corresponding path program 1 times [2024-11-27 23:34:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770437540] [2024-11-27 23:34:12,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:12,916 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-27 23:34:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770437540] [2024-11-27 23:34:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770437540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092706652] [2024-11-27 23:34:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:12,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:12,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:12,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:12,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-11-27 23:34:12,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:34:12,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:12,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-11-27 23:34:12,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:13,289 INFO L124 PetriNetUnfolderBase]: 44/1002 cut-off events. [2024-11-27 23:34:13,289 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-27 23:34:13,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 1002 events. 44/1002 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3573 event pairs, 6 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 952. Up to 26 conditions per place. [2024-11-27 23:34:13,311 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-11-27 23:34:13,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1492 flow [2024-11-27 23:34:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-27 23:34:13,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-11-27 23:34:13,318 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2242 transitions. [2024-11-27 23:34:13,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1492 flow [2024-11-27 23:34:13,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:13,333 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2024-11-27 23:34:13,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2024-11-27 23:34:13,336 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-11-27 23:34:13,337 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2024-11-27 23:34:13,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:34:13,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:13,339 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] [2024-11-27 23:34:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:34:13,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash -991558104, now seen corresponding path program 1 times [2024-11-27 23:34:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232268662] [2024-11-27 23:34:13,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:13,471 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-27 23:34:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:13,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232268662] [2024-11-27 23:34:13,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232268662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:13,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:13,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367296973] [2024-11-27 23:34:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:13,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:13,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:13,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:13,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-27 23:34:13,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-27 23:34:13,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:13,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-27 23:34:13,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:13,765 INFO L124 PetriNetUnfolderBase]: 31/736 cut-off events. [2024-11-27 23:34:13,765 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-27 23:34:13,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 736 events. 31/736 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2475 event pairs, 5 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 675. Up to 23 conditions per place. [2024-11-27 23:34:13,782 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-11-27 23:34:13,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1488 flow [2024-11-27 23:34:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-11-27 23:34:13,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-11-27 23:34:13,787 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2244 transitions. [2024-11-27 23:34:13,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1488 flow [2024-11-27 23:34:13,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:13,798 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2024-11-27 23:34:13,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2024-11-27 23:34:13,802 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2024-11-27 23:34:13,802 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2024-11-27 23:34:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-27 23:34:13,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:13,805 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] [2024-11-27 23:34:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:34:13,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1860382154, now seen corresponding path program 1 times [2024-11-27 23:34:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582561030] [2024-11-27 23:34:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:13,904 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-27 23:34:13,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582561030] [2024-11-27 23:34:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582561030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:13,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:13,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272022993] [2024-11-27 23:34:13,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:13,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:13,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:13,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:14,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-11-27 23:34:14,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-27 23:34:14,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:14,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-11-27 23:34:14,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:14,314 INFO L124 PetriNetUnfolderBase]: 50/1000 cut-off events. [2024-11-27 23:34:14,315 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-27 23:34:14,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1000 events. 50/1000 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4118 event pairs, 12 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 952. Up to 44 conditions per place. [2024-11-27 23:34:14,334 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-11-27 23:34:14,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 725 transitions, 1500 flow [2024-11-27 23:34:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-11-27 23:34:14,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-11-27 23:34:14,341 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 3 states and 2230 transitions. [2024-11-27 23:34:14,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 725 transitions, 1500 flow [2024-11-27 23:34:14,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 725 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:14,354 INFO L231 Difference]: Finished difference. Result has 704 places, 725 transitions, 1458 flow [2024-11-27 23:34:14,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=704, PETRI_TRANSITIONS=725} [2024-11-27 23:34:14,357 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -14 predicate places. [2024-11-27 23:34:14,358 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 725 transitions, 1458 flow [2024-11-27 23:34:14,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-27 23:34:14,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:14,360 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] [2024-11-27 23:34:14,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:34:14,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:14,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2092362532, now seen corresponding path program 1 times [2024-11-27 23:34:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013610612] [2024-11-27 23:34:14,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:15,570 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-27 23:34:15,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:15,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013610612] [2024-11-27 23:34:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013610612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:15,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:34:15,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245214964] [2024-11-27 23:34:15,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:15,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:34:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:15,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:34:15,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:34:15,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 774 [2024-11-27 23:34:15,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 725 transitions, 1458 flow. Second operand has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 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-27 23:34:15,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:15,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 774 [2024-11-27 23:34:15,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:16,762 INFO L124 PetriNetUnfolderBase]: 131/2347 cut-off events. [2024-11-27 23:34:16,762 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-27 23:34:16,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 2347 events. 131/2347 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 13184 event pairs, 24 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2339. Up to 84 conditions per place. [2024-11-27 23:34:16,809 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 20 selfloop transitions, 5 changer transitions 0/724 dead transitions. [2024-11-27 23:34:16,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 724 transitions, 1506 flow [2024-11-27 23:34:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:34:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:34:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4424 transitions. [2024-11-27 23:34:16,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526270456503014 [2024-11-27 23:34:16,825 INFO L175 Difference]: Start difference. First operand has 704 places, 725 transitions, 1458 flow. Second operand 6 states and 4424 transitions. [2024-11-27 23:34:16,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 724 transitions, 1506 flow [2024-11-27 23:34:16,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 724 transitions, 1502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:16,841 INFO L231 Difference]: Finished difference. Result has 706 places, 724 transitions, 1462 flow [2024-11-27 23:34:16,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=724} [2024-11-27 23:34:16,844 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-11-27 23:34:16,844 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 724 transitions, 1462 flow [2024-11-27 23:34:16,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 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-27 23:34:16,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:16,848 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] [2024-11-27 23:34:16,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:34:16,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 282102408, now seen corresponding path program 1 times [2024-11-27 23:34:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584622126] [2024-11-27 23:34:16,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:16,933 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-27 23:34:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584622126] [2024-11-27 23:34:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584622126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:16,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618556097] [2024-11-27 23:34:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:16,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:16,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:16,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:16,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-27 23:34:16,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 724 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-27 23:34:16,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:16,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-27 23:34:16,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:17,290 INFO L124 PetriNetUnfolderBase]: 52/1222 cut-off events. [2024-11-27 23:34:17,290 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-27 23:34:17,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1222 events. 52/1222 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4250 event pairs, 3 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1234. Up to 18 conditions per place. [2024-11-27 23:34:17,313 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 9 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-11-27 23:34:17,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 723 transitions, 1482 flow [2024-11-27 23:34:17,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-11-27 23:34:17,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689922480620154 [2024-11-27 23:34:17,319 INFO L175 Difference]: Start difference. First operand has 706 places, 724 transitions, 1462 flow. Second operand 3 states and 2250 transitions. [2024-11-27 23:34:17,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 723 transitions, 1482 flow [2024-11-27 23:34:17,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 723 transitions, 1472 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 23:34:17,334 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2024-11-27 23:34:17,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2024-11-27 23:34:17,337 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -16 predicate places. [2024-11-27 23:34:17,337 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2024-11-27 23:34:17,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-27 23:34:17,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:17,341 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-27 23:34:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:34:17,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 103713176, now seen corresponding path program 1 times [2024-11-27 23:34:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684545812] [2024-11-27 23:34:17,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:17,421 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-27 23:34:17,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684545812] [2024-11-27 23:34:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684545812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:17,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:17,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912680457] [2024-11-27 23:34:17,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:17,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:17,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:17,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:17,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-11-27 23:34:17,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 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-27 23:34:17,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:17,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-11-27 23:34:17,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:17,806 INFO L124 PetriNetUnfolderBase]: 59/1274 cut-off events. [2024-11-27 23:34:17,806 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2024-11-27 23:34:17,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1274 events. 59/1274 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5949 event pairs, 2 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1167. Up to 27 conditions per place. [2024-11-27 23:34:17,829 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-11-27 23:34:17,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1485 flow [2024-11-27 23:34:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-11-27 23:34:17,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-11-27 23:34:17,836 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2248 transitions. [2024-11-27 23:34:17,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1485 flow [2024-11-27 23:34:17,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:17,849 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2024-11-27 23:34:17,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2024-11-27 23:34:17,851 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -17 predicate places. [2024-11-27 23:34:17,852 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2024-11-27 23:34:17,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 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-27 23:34:17,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:34:17,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 23:34:17,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash -711552444, now seen corresponding path program 1 times [2024-11-27 23:34:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828372375] [2024-11-27 23:34:17,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:17,926 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-27 23:34:17,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828372375] [2024-11-27 23:34:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828372375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968376914] [2024-11-27 23:34:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:17,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:17,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:18,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:18,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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-27 23:34:18,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:18,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:18,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:18,362 INFO L124 PetriNetUnfolderBase]: 65/1273 cut-off events. [2024-11-27 23:34:18,362 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2024-11-27 23:34:18,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1273 events. 65/1273 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5980 event pairs, 13 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 1178. Up to 45 conditions per place. [2024-11-27 23:34:18,386 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2024-11-27 23:34:18,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1495 flow [2024-11-27 23:34:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-11-27 23:34:18,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-11-27 23:34:18,394 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2236 transitions. [2024-11-27 23:34:18,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1495 flow [2024-11-27 23:34:18,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:18,408 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2024-11-27 23:34:18,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=700, PETRI_TRANSITIONS=721} [2024-11-27 23:34:18,410 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -18 predicate places. [2024-11-27 23:34:18,410 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2024-11-27 23:34:18,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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-27 23:34:18,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:18,412 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] [2024-11-27 23:34:18,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 23:34:18,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1024278956, now seen corresponding path program 1 times [2024-11-27 23:34:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995373861] [2024-11-27 23:34:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:18,510 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-27 23:34:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995373861] [2024-11-27 23:34:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995373861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697596779] [2024-11-27 23:34:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:18,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:18,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-11-27 23:34:18,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 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-27 23:34:18,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:18,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-11-27 23:34:18,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:18,861 INFO L124 PetriNetUnfolderBase]: 47/998 cut-off events. [2024-11-27 23:34:18,862 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-27 23:34:18,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 998 events. 47/998 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3609 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 865. Up to 27 conditions per place. [2024-11-27 23:34:18,883 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2024-11-27 23:34:18,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 721 transitions, 1481 flow [2024-11-27 23:34:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-11-27 23:34:18,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-11-27 23:34:18,889 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2248 transitions. [2024-11-27 23:34:18,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 721 transitions, 1481 flow [2024-11-27 23:34:18,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 721 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:18,902 INFO L231 Difference]: Finished difference. Result has 699 places, 720 transitions, 1448 flow [2024-11-27 23:34:18,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=699, PETRI_TRANSITIONS=720} [2024-11-27 23:34:18,905 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -19 predicate places. [2024-11-27 23:34:18,905 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 720 transitions, 1448 flow [2024-11-27 23:34:18,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 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-27 23:34:18,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:18,906 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] [2024-11-27 23:34:18,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 23:34:18,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2101460573, now seen corresponding path program 1 times [2024-11-27 23:34:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:18,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037881846] [2024-11-27 23:34:18,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:19,005 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-27 23:34:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037881846] [2024-11-27 23:34:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037881846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793490340] [2024-11-27 23:34:19,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:19,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:19,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:19,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:19,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-11-27 23:34:19,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 720 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-27 23:34:19,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:19,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-11-27 23:34:19,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:20,443 INFO L124 PetriNetUnfolderBase]: 383/5332 cut-off events. [2024-11-27 23:34:20,444 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-27 23:34:20,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 5332 events. 383/5332 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 40998 event pairs, 100 based on Foata normal form. 0/4262 useless extension candidates. Maximal degree in co-relation 5179. Up to 296 conditions per place. [2024-11-27 23:34:20,508 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2024-11-27 23:34:20,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1491 flow [2024-11-27 23:34:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-11-27 23:34:20,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-11-27 23:34:20,515 INFO L175 Difference]: Start difference. First operand has 699 places, 720 transitions, 1448 flow. Second operand 3 states and 2210 transitions. [2024-11-27 23:34:20,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1491 flow [2024-11-27 23:34:20,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:20,536 INFO L231 Difference]: Finished difference. Result has 690 places, 712 transitions, 1438 flow [2024-11-27 23:34:20,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=690, PETRI_TRANSITIONS=712} [2024-11-27 23:34:20,538 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -28 predicate places. [2024-11-27 23:34:20,538 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 712 transitions, 1438 flow [2024-11-27 23:34:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-27 23:34:20,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:20,540 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-27 23:34:20,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 23:34:20,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 869037951, now seen corresponding path program 1 times [2024-11-27 23:34:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221910082] [2024-11-27 23:34:20,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:20,645 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-27 23:34:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221910082] [2024-11-27 23:34:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221910082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:20,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:20,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925484928] [2024-11-27 23:34:20,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:20,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:20,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:20,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:20,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-11-27 23:34:20,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 712 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-27 23:34:20,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:20,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-11-27 23:34:20,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:22,074 INFO L124 PetriNetUnfolderBase]: 398/5526 cut-off events. [2024-11-27 23:34:22,075 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-27 23:34:22,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 5526 events. 398/5526 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43159 event pairs, 100 based on Foata normal form. 0/4483 useless extension candidates. Maximal degree in co-relation 5425. Up to 304 conditions per place. [2024-11-27 23:34:22,136 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2024-11-27 23:34:22,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 705 transitions, 1481 flow [2024-11-27 23:34:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-11-27 23:34:22,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-11-27 23:34:22,143 INFO L175 Difference]: Start difference. First operand has 690 places, 712 transitions, 1438 flow. Second operand 3 states and 2210 transitions. [2024-11-27 23:34:22,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 705 transitions, 1481 flow [2024-11-27 23:34:22,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 705 transitions, 1481 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:34:22,156 INFO L231 Difference]: Finished difference. Result has 683 places, 704 transitions, 1432 flow [2024-11-27 23:34:22,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=683, PETRI_TRANSITIONS=704} [2024-11-27 23:34:22,158 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -35 predicate places. [2024-11-27 23:34:22,158 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 704 transitions, 1432 flow [2024-11-27 23:34:22,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-27 23:34:22,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:22,159 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] [2024-11-27 23:34:22,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 23:34:22,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:22,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1728926341, now seen corresponding path program 1 times [2024-11-27 23:34:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887463285] [2024-11-27 23:34:22,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:22,258 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-27 23:34:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:22,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887463285] [2024-11-27 23:34:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887463285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617659088] [2024-11-27 23:34:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:22,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:22,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:22,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 704 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-27 23:34:22,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:22,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:22,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:22,681 INFO L124 PetriNetUnfolderBase]: 79/1465 cut-off events. [2024-11-27 23:34:22,681 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-27 23:34:22,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1465 events. 79/1465 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7743 event pairs, 2 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1122. Up to 67 conditions per place. [2024-11-27 23:34:22,698 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2024-11-27 23:34:22,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 704 transitions, 1475 flow [2024-11-27 23:34:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-11-27 23:34:22,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-11-27 23:34:22,704 INFO L175 Difference]: Start difference. First operand has 683 places, 704 transitions, 1432 flow. Second operand 3 states and 2236 transitions. [2024-11-27 23:34:22,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 704 transitions, 1475 flow [2024-11-27 23:34:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 704 transitions, 1475 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:34:22,718 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1434 flow [2024-11-27 23:34:22,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=684, PETRI_TRANSITIONS=703} [2024-11-27 23:34:22,719 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -34 predicate places. [2024-11-27 23:34:22,720 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1434 flow [2024-11-27 23:34:22,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-27 23:34:22,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:22,722 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] [2024-11-27 23:34:22,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 23:34:22,722 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:22,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -551507349, now seen corresponding path program 1 times [2024-11-27 23:34:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:22,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363094067] [2024-11-27 23:34:22,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:22,794 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-27 23:34:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363094067] [2024-11-27 23:34:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363094067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:22,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927915786] [2024-11-27 23:34:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:22,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:22,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:22,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-11-27 23:34:22,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 703 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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-27 23:34:22,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:22,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-11-27 23:34:22,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:23,407 INFO L124 PetriNetUnfolderBase]: 116/2291 cut-off events. [2024-11-27 23:34:23,408 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-27 23:34:23,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 2291 events. 116/2291 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12461 event pairs, 4 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 1968. Up to 28 conditions per place. [2024-11-27 23:34:23,433 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 17 selfloop transitions, 9 changer transitions 0/702 dead transitions. [2024-11-27 23:34:23,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 702 transitions, 1485 flow [2024-11-27 23:34:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2024-11-27 23:34:23,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9595176571920758 [2024-11-27 23:34:23,439 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1434 flow. Second operand 3 states and 2228 transitions. [2024-11-27 23:34:23,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 702 transitions, 1485 flow [2024-11-27 23:34:23,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 702 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:23,453 INFO L231 Difference]: Finished difference. Result has 679 places, 701 transitions, 1461 flow [2024-11-27 23:34:23,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=679, PETRI_TRANSITIONS=701} [2024-11-27 23:34:23,455 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-11-27 23:34:23,455 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 701 transitions, 1461 flow [2024-11-27 23:34:23,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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-27 23:34:23,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:23,457 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] [2024-11-27 23:34:23,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 23:34:23,457 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1733378458, now seen corresponding path program 1 times [2024-11-27 23:34:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630437017] [2024-11-27 23:34:23,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:23,531 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-27 23:34:23,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:23,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630437017] [2024-11-27 23:34:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630437017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:23,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:23,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:23,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692190258] [2024-11-27 23:34:23,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:23,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:23,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:23,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:23,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:34:23,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 701 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-27 23:34:23,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:23,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:34:23,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:24,215 INFO L124 PetriNetUnfolderBase]: 112/2245 cut-off events. [2024-11-27 23:34:24,215 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2024-11-27 23:34:24,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 2245 events. 112/2245 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14441 event pairs, 10 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 1941. Up to 44 conditions per place. [2024-11-27 23:34:24,230 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 20 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2024-11-27 23:34:24,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 701 transitions, 1508 flow [2024-11-27 23:34:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-27 23:34:24,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646856158484065 [2024-11-27 23:34:24,234 INFO L175 Difference]: Start difference. First operand has 679 places, 701 transitions, 1461 flow. Second operand 3 states and 2240 transitions. [2024-11-27 23:34:24,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 701 transitions, 1508 flow [2024-11-27 23:34:24,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 701 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:34:24,248 INFO L231 Difference]: Finished difference. Result has 679 places, 700 transitions, 1456 flow [2024-11-27 23:34:24,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=679, PETRI_TRANSITIONS=700} [2024-11-27 23:34:24,250 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-11-27 23:34:24,250 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 700 transitions, 1456 flow [2024-11-27 23:34:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-27 23:34:24,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:24,251 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-27 23:34:24,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 23:34:24,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash 527119404, now seen corresponding path program 1 times [2024-11-27 23:34:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068111535] [2024-11-27 23:34:24,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:24,343 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-27 23:34:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068111535] [2024-11-27 23:34:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068111535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:24,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:24,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:24,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226565598] [2024-11-27 23:34:24,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:24,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:24,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:24,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:24,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-11-27 23:34:24,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 700 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 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-27 23:34:24,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:24,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-11-27 23:34:24,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:24,805 INFO L124 PetriNetUnfolderBase]: 76/1484 cut-off events. [2024-11-27 23:34:24,805 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-27 23:34:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1484 events. 76/1484 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7801 event pairs, 7 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1154. Up to 43 conditions per place. [2024-11-27 23:34:24,827 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 13 selfloop transitions, 8 changer transitions 13/699 dead transitions. [2024-11-27 23:34:24,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 699 transitions, 1505 flow [2024-11-27 23:34:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2024-11-27 23:34:24,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959086993970715 [2024-11-27 23:34:24,833 INFO L175 Difference]: Start difference. First operand has 679 places, 700 transitions, 1456 flow. Second operand 3 states and 2227 transitions. [2024-11-27 23:34:24,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 699 transitions, 1505 flow [2024-11-27 23:34:24,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 699 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:24,848 INFO L231 Difference]: Finished difference. Result has 674 places, 685 transitions, 1449 flow [2024-11-27 23:34:24,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=674, PETRI_TRANSITIONS=685} [2024-11-27 23:34:24,850 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -44 predicate places. [2024-11-27 23:34:24,851 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 685 transitions, 1449 flow [2024-11-27 23:34:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 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-27 23:34:24,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:24,852 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] [2024-11-27 23:34:24,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 23:34:24,852 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 986153850, now seen corresponding path program 1 times [2024-11-27 23:34:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307475444] [2024-11-27 23:34:24,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:24,924 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-27 23:34:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307475444] [2024-11-27 23:34:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307475444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:24,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:24,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581238375] [2024-11-27 23:34:24,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:24,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:24,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:24,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:25,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:34:25,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 685 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-27 23:34:25,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:25,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:34:25,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:25,420 INFO L124 PetriNetUnfolderBase]: 75/1468 cut-off events. [2024-11-27 23:34:25,421 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2024-11-27 23:34:25,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1468 events. 75/1468 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7623 event pairs, 10 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1419. Up to 67 conditions per place. [2024-11-27 23:34:25,439 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2024-11-27 23:34:25,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 685 transitions, 1490 flow [2024-11-27 23:34:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-27 23:34:25,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-27 23:34:25,445 INFO L175 Difference]: Start difference. First operand has 674 places, 685 transitions, 1449 flow. Second operand 3 states and 2237 transitions. [2024-11-27 23:34:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 685 transitions, 1490 flow [2024-11-27 23:34:25,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 685 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:34:25,458 INFO L231 Difference]: Finished difference. Result has 662 places, 684 transitions, 1445 flow [2024-11-27 23:34:25,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1445, PETRI_PLACES=662, PETRI_TRANSITIONS=684} [2024-11-27 23:34:25,459 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-11-27 23:34:25,459 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 684 transitions, 1445 flow [2024-11-27 23:34:25,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-27 23:34:25,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:25,461 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-27 23:34:25,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 23:34:25,461 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:25,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash -562303117, now seen corresponding path program 1 times [2024-11-27 23:34:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936885755] [2024-11-27 23:34:25,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:25,536 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-27 23:34:25,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:25,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936885755] [2024-11-27 23:34:25,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936885755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:34:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751045826] [2024-11-27 23:34:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:25,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:25,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:25,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-27 23:34:25,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 684 transitions, 1445 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-27 23:34:25,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:25,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-27 23:34:25,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:26,813 INFO L124 PetriNetUnfolderBase]: 227/4868 cut-off events. [2024-11-27 23:34:26,814 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-27 23:34:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 4868 events. 227/4868 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41600 event pairs, 12 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 4505. Up to 99 conditions per place. [2024-11-27 23:34:26,854 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 17 selfloop transitions, 4 changer transitions 0/690 dead transitions. [2024-11-27 23:34:26,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 690 transitions, 1501 flow [2024-11-27 23:34:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2024-11-27 23:34:26,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970714900947459 [2024-11-27 23:34:26,858 INFO L175 Difference]: Start difference. First operand has 662 places, 684 transitions, 1445 flow. Second operand 3 states and 2254 transitions. [2024-11-27 23:34:26,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 690 transitions, 1501 flow [2024-11-27 23:34:26,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 690 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:26,873 INFO L231 Difference]: Finished difference. Result has 664 places, 688 transitions, 1479 flow [2024-11-27 23:34:26,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=664, PETRI_TRANSITIONS=688} [2024-11-27 23:34:26,875 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-11-27 23:34:26,875 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 688 transitions, 1479 flow [2024-11-27 23:34:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-27 23:34:26,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:26,876 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-27 23:34:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 23:34:26,876 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2076146351, now seen corresponding path program 1 times [2024-11-27 23:34:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880516545] [2024-11-27 23:34:26,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:26,938 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-27 23:34:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880516545] [2024-11-27 23:34:26,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880516545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:26,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:26,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907912537] [2024-11-27 23:34:26,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:26,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:26,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:26,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:27,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-11-27 23:34:27,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 688 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 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-27 23:34:27,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:27,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-11-27 23:34:27,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:28,294 INFO L124 PetriNetUnfolderBase]: 317/6361 cut-off events. [2024-11-27 23:34:28,294 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-27 23:34:28,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 6361 events. 317/6361 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56128 event pairs, 15 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 5735. Up to 138 conditions per place. [2024-11-27 23:34:28,343 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/685 dead transitions. [2024-11-27 23:34:28,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 685 transitions, 1532 flow [2024-11-27 23:34:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-11-27 23:34:28,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-11-27 23:34:28,348 INFO L175 Difference]: Start difference. First operand has 664 places, 688 transitions, 1479 flow. Second operand 3 states and 2215 transitions. [2024-11-27 23:34:28,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 685 transitions, 1532 flow [2024-11-27 23:34:28,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 685 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:34:28,360 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1511 flow [2024-11-27 23:34:28,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=659, PETRI_TRANSITIONS=684} [2024-11-27 23:34:28,362 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-27 23:34:28,362 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1511 flow [2024-11-27 23:34:28,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 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-27 23:34:28,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:28,364 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] [2024-11-27 23:34:28,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 23:34:28,364 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:28,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1227535886, now seen corresponding path program 1 times [2024-11-27 23:34:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320686439] [2024-11-27 23:34:28,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:28,422 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-27 23:34:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320686439] [2024-11-27 23:34:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320686439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:28,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:28,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30754890] [2024-11-27 23:34:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:28,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:28,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:28,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:28,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:28,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 684 transitions, 1511 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-27 23:34:28,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:28,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:28,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:29,949 INFO L124 PetriNetUnfolderBase]: 298/6252 cut-off events. [2024-11-27 23:34:29,949 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-11-27 23:34:29,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 6252 events. 298/6252 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 60232 event pairs, 32 based on Foata normal form. 0/5301 useless extension candidates. Maximal degree in co-relation 5677. Up to 122 conditions per place. [2024-11-27 23:34:30,027 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2024-11-27 23:34:30,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 684 transitions, 1560 flow [2024-11-27 23:34:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-11-27 23:34:30,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-11-27 23:34:30,032 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1511 flow. Second operand 3 states and 2235 transitions. [2024-11-27 23:34:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 684 transitions, 1560 flow [2024-11-27 23:34:30,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 684 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:30,046 INFO L231 Difference]: Finished difference. Result has 658 places, 683 transitions, 1497 flow [2024-11-27 23:34:30,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=658, PETRI_TRANSITIONS=683} [2024-11-27 23:34:30,048 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-11-27 23:34:30,048 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 683 transitions, 1497 flow [2024-11-27 23:34:30,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-27 23:34:30,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:30,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, 1, 1, 1, 1, 1, 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-27 23:34:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 23:34:30,050 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -629664846, now seen corresponding path program 1 times [2024-11-27 23:34:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538331004] [2024-11-27 23:34:30,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:30,113 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-27 23:34:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538331004] [2024-11-27 23:34:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538331004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680154689] [2024-11-27 23:34:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:30,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:30,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:30,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:30,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-11-27 23:34:30,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 683 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 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-27 23:34:30,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:30,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-11-27 23:34:30,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:31,566 INFO L124 PetriNetUnfolderBase]: 318/5797 cut-off events. [2024-11-27 23:34:31,567 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2024-11-27 23:34:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 5797 events. 318/5797 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55895 event pairs, 16 based on Foata normal form. 0/4977 useless extension candidates. Maximal degree in co-relation 5688. Up to 262 conditions per place. [2024-11-27 23:34:31,723 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/680 dead transitions. [2024-11-27 23:34:31,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 680 transitions, 1550 flow [2024-11-27 23:34:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-11-27 23:34:31,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-11-27 23:34:31,728 INFO L175 Difference]: Start difference. First operand has 658 places, 683 transitions, 1497 flow. Second operand 3 states and 2215 transitions. [2024-11-27 23:34:31,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 680 transitions, 1550 flow [2024-11-27 23:34:31,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:31,737 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1527 flow [2024-11-27 23:34:31,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=652, PETRI_TRANSITIONS=679} [2024-11-27 23:34:31,739 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -66 predicate places. [2024-11-27 23:34:31,739 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1527 flow [2024-11-27 23:34:31,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 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-27 23:34:31,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:31,740 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-27 23:34:31,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 23:34:31,740 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:31,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:31,741 INFO L85 PathProgramCache]: Analyzing trace with hash 663718086, now seen corresponding path program 1 times [2024-11-27 23:34:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398613651] [2024-11-27 23:34:31,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:31,806 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-27 23:34:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398613651] [2024-11-27 23:34:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398613651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764504981] [2024-11-27 23:34:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:31,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:31,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:31,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-27 23:34:31,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 679 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-27 23:34:31,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:31,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-27 23:34:31,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:33,473 INFO L124 PetriNetUnfolderBase]: 300/5767 cut-off events. [2024-11-27 23:34:33,473 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2024-11-27 23:34:33,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 5767 events. 300/5767 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55045 event pairs, 35 based on Foata normal form. 0/4963 useless extension candidates. Maximal degree in co-relation 5780. Up to 235 conditions per place. [2024-11-27 23:34:33,694 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2024-11-27 23:34:33,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 679 transitions, 1576 flow [2024-11-27 23:34:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-11-27 23:34:33,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-11-27 23:34:33,703 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1527 flow. Second operand 3 states and 2235 transitions. [2024-11-27 23:34:33,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 679 transitions, 1576 flow [2024-11-27 23:34:33,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 679 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:33,717 INFO L231 Difference]: Finished difference. Result has 651 places, 678 transitions, 1513 flow [2024-11-27 23:34:33,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=651, PETRI_TRANSITIONS=678} [2024-11-27 23:34:33,718 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -67 predicate places. [2024-11-27 23:34:33,718 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 678 transitions, 1513 flow [2024-11-27 23:34:33,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-27 23:34:33,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:33,720 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] [2024-11-27 23:34:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 23:34:33,720 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2071009915, now seen corresponding path program 1 times [2024-11-27 23:34:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819157821] [2024-11-27 23:34:33,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:33,781 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-27 23:34:33,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819157821] [2024-11-27 23:34:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819157821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:33,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:33,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:33,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141533193] [2024-11-27 23:34:33,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:33,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:33,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:33,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:34:33,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 678 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-27 23:34:33,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:33,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:34:33,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:35,470 INFO L124 PetriNetUnfolderBase]: 263/5685 cut-off events. [2024-11-27 23:34:35,470 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-27 23:34:35,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 5685 events. 263/5685 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54355 event pairs, 9 based on Foata normal form. 0/4946 useless extension candidates. Maximal degree in co-relation 5448. Up to 106 conditions per place. [2024-11-27 23:34:35,535 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-11-27 23:34:35,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 675 transitions, 1538 flow [2024-11-27 23:34:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-11-27 23:34:35,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-11-27 23:34:35,539 INFO L175 Difference]: Start difference. First operand has 651 places, 678 transitions, 1513 flow. Second operand 3 states and 2239 transitions. [2024-11-27 23:34:35,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 675 transitions, 1538 flow [2024-11-27 23:34:35,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 675 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:35,552 INFO L231 Difference]: Finished difference. Result has 647 places, 674 transitions, 1505 flow [2024-11-27 23:34:35,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=647, PETRI_TRANSITIONS=674} [2024-11-27 23:34:35,553 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -71 predicate places. [2024-11-27 23:34:35,553 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 674 transitions, 1505 flow [2024-11-27 23:34:35,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-27 23:34:35,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:35,555 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-27 23:34:35,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 23:34:35,555 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:35,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2045536528, now seen corresponding path program 1 times [2024-11-27 23:34:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636036946] [2024-11-27 23:34:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:35,622 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-27 23:34:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636036946] [2024-11-27 23:34:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636036946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289977684] [2024-11-27 23:34:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:35,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:35,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:35,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:34:35,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 674 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-27 23:34:35,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:35,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:34:35,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:37,358 INFO L124 PetriNetUnfolderBase]: 291/5673 cut-off events. [2024-11-27 23:34:37,358 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2024-11-27 23:34:37,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 5673 events. 291/5673 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 53516 event pairs, 12 based on Foata normal form. 0/4965 useless extension candidates. Maximal degree in co-relation 5570. Up to 162 conditions per place. [2024-11-27 23:34:37,442 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-11-27 23:34:37,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 671 transitions, 1530 flow [2024-11-27 23:34:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-11-27 23:34:37,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-11-27 23:34:37,447 INFO L175 Difference]: Start difference. First operand has 647 places, 674 transitions, 1505 flow. Second operand 3 states and 2239 transitions. [2024-11-27 23:34:37,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 671 transitions, 1530 flow [2024-11-27 23:34:37,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 671 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:37,459 INFO L231 Difference]: Finished difference. Result has 643 places, 670 transitions, 1497 flow [2024-11-27 23:34:37,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=643, PETRI_TRANSITIONS=670} [2024-11-27 23:34:37,460 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-11-27 23:34:37,461 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 670 transitions, 1497 flow [2024-11-27 23:34:37,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-27 23:34:37,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:37,462 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] [2024-11-27 23:34:37,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-27 23:34:37,463 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 612823764, now seen corresponding path program 1 times [2024-11-27 23:34:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898607211] [2024-11-27 23:34:37,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:37,560 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-27 23:34:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898607211] [2024-11-27 23:34:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898607211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238283765] [2024-11-27 23:34:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:37,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:37,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:37,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-11-27 23:34:37,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 670 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-27 23:34:37,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:37,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-11-27 23:34:37,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:40,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,176 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-27 23:34:40,177 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,177 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:34:40,177 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,177 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-27 23:34:40,178 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:34:40,178 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:34:40,178 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:34:40,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,182 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-27 23:34:40,182 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,182 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:34:40,182 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,204 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-27 23:34:40,204 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:34:40,205 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:34:40,205 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:34:40,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,245 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-27 23:34:40,245 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,246 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,246 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,246 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:40,246 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:40,246 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,246 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,248 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:40,248 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,248 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,248 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:40,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,249 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-27 23:34:40,249 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,249 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,249 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,252 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:40,252 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,252 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:40,252 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,255 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:40,256 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,256 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,256 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:40,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,273 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-27 23:34:40,273 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,273 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,273 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,277 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-27 23:34:40,277 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:40,277 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,278 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-27 23:34:40,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,314 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-27 23:34:40,314 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,314 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-27 23:34:40,315 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-27 23:34:40,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,315 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-27 23:34:40,315 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:40,315 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:34:40,315 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:40,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,319 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-27 23:34:40,319 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:40,319 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:40,319 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:34:40,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:40,336 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-27 23:34:40,337 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-27 23:34:40,337 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:40,337 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-27 23:34:40,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-27 23:34:40,429 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-27 23:34:40,429 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-27 23:34:40,429 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-27 23:34:40,429 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-11-27 23:34:40,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-27 23:34:40,430 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-27 23:34:40,430 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-27 23:34:40,430 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-27 23:34:40,430 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-27 23:34:40,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-27 23:34:40,442 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-27 23:34:40,442 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2024-11-27 23:34:40,442 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-27 23:34:40,442 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-27 23:34:40,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 829#true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-27 23:34:40,454 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-27 23:34:40,454 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:34:40,454 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-27 23:34:40,454 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:34:40,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-27 23:34:40,455 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-27 23:34:40,455 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-27 23:34:40,455 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:34:40,455 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:34:40,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-27 23:34:40,464 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-27 23:34:40,464 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2024-11-27 23:34:40,464 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-27 23:34:40,464 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-27 23:34:40,563 INFO L124 PetriNetUnfolderBase]: 565/10661 cut-off events. [2024-11-27 23:34:40,563 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-11-27 23:34:40,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 10661 events. 565/10661 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 107636 event pairs, 22 based on Foata normal form. 0/9336 useless extension candidates. Maximal degree in co-relation 10879. Up to 298 conditions per place. [2024-11-27 23:34:40,703 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 2 changer transitions 0/672 dead transitions. [2024-11-27 23:34:40,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 672 transitions, 1527 flow [2024-11-27 23:34:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-11-27 23:34:40,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-11-27 23:34:40,706 INFO L175 Difference]: Start difference. First operand has 643 places, 670 transitions, 1497 flow. Second operand 3 states and 2258 transitions. [2024-11-27 23:34:40,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 672 transitions, 1527 flow [2024-11-27 23:34:40,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 672 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:40,717 INFO L231 Difference]: Finished difference. Result has 642 places, 670 transitions, 1501 flow [2024-11-27 23:34:40,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=642, PETRI_TRANSITIONS=670} [2024-11-27 23:34:40,718 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -76 predicate places. [2024-11-27 23:34:40,718 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 670 transitions, 1501 flow [2024-11-27 23:34:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-27 23:34:40,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:40,719 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] [2024-11-27 23:34:40,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 23:34:40,719 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:40,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -872907179, now seen corresponding path program 1 times [2024-11-27 23:34:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361409888] [2024-11-27 23:34:40,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:40,794 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-27 23:34:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361409888] [2024-11-27 23:34:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361409888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:40,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:40,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:34:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119671589] [2024-11-27 23:34:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:40,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:34:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:40,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:34:40,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:34:40,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:34:40,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 670 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-27 23:34:40,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:40,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:34:40,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:42,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:42,875 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:42,875 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:42,875 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:42,955 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:42,955 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:42,955 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:43,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:43,732 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-27 23:34:43,732 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:43,732 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:34:43,732 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:34:43,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:43,784 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:43,784 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:43,784 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:43,784 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:43,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:43,786 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:43,786 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:43,786 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:43,786 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:43,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:43,824 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-27 23:34:43,824 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:43,824 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:43,824 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:34:44,061 INFO L124 PetriNetUnfolderBase]: 706/15546 cut-off events. [2024-11-27 23:34:44,061 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-27 23:34:44,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17503 conditions, 15546 events. 706/15546 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 173754 event pairs, 63 based on Foata normal form. 0/13771 useless extension candidates. Maximal degree in co-relation 16427. Up to 356 conditions per place. [2024-11-27 23:34:44,221 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-11-27 23:34:44,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 670 transitions, 1542 flow [2024-11-27 23:34:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:34:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:34:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-27 23:34:44,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-27 23:34:44,223 INFO L175 Difference]: Start difference. First operand has 642 places, 670 transitions, 1501 flow. Second operand 3 states and 2237 transitions. [2024-11-27 23:34:44,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 670 transitions, 1542 flow [2024-11-27 23:34:44,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 670 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:34:44,519 INFO L231 Difference]: Finished difference. Result has 643 places, 669 transitions, 1505 flow [2024-11-27 23:34:44,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=643, PETRI_TRANSITIONS=669} [2024-11-27 23:34:44,520 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-11-27 23:34:44,520 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 669 transitions, 1505 flow [2024-11-27 23:34:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-27 23:34:44,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:34:44,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 23:34:44,521 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:44,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1443272931, now seen corresponding path program 1 times [2024-11-27 23:34:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:44,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693051028] [2024-11-27 23:34:44,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:44,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:44,719 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-27 23:34:44,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:44,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693051028] [2024-11-27 23:34:44,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693051028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:44,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:44,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:34:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285870626] [2024-11-27 23:34:44,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:44,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:34:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:44,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:34:44,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:34:44,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-27 23:34:44,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 669 transitions, 1505 flow. Second operand has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 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-27 23:34:44,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:44,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-27 23:34:44,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:47,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:47,162 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-27 23:34:47,162 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:47,162 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:34:47,162 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-27 23:34:47,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 504#L108-4true, 847#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:47,207 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-27 23:34:47,207 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:47,207 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:34:47,207 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-27 23:34:47,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:47,790 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2024-11-27 23:34:47,790 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-27 23:34:47,790 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-27 23:34:47,790 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-27 23:34:47,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:47,807 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-11-27 23:34:47,807 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-27 23:34:47,807 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-11-27 23:34:47,807 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-27 23:34:47,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:47,810 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-11-27 23:34:47,810 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-11-27 23:34:47,810 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-27 23:34:47,810 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-27 23:34:47,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:47,827 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2024-11-27 23:34:47,827 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-27 23:34:47,827 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-27 23:34:47,828 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-27 23:34:48,396 INFO L124 PetriNetUnfolderBase]: 463/10013 cut-off events. [2024-11-27 23:34:48,397 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-27 23:34:48,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 10013 events. 463/10013 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 92234 event pairs, 26 based on Foata normal form. 0/8837 useless extension candidates. Maximal degree in co-relation 11011. Up to 159 conditions per place. [2024-11-27 23:34:48,489 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 13 selfloop transitions, 8 changer transitions 0/678 dead transitions. [2024-11-27 23:34:48,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 678 transitions, 1569 flow [2024-11-27 23:34:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:34:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:34:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3752 transitions. [2024-11-27 23:34:48,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695090439276486 [2024-11-27 23:34:48,492 INFO L175 Difference]: Start difference. First operand has 643 places, 669 transitions, 1505 flow. Second operand 5 states and 3752 transitions. [2024-11-27 23:34:48,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 678 transitions, 1569 flow [2024-11-27 23:34:48,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 678 transitions, 1563 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:34:48,501 INFO L231 Difference]: Finished difference. Result has 648 places, 673 transitions, 1545 flow [2024-11-27 23:34:48,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1545, PETRI_PLACES=648, PETRI_TRANSITIONS=673} [2024-11-27 23:34:48,502 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -70 predicate places. [2024-11-27 23:34:48,502 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 673 transitions, 1545 flow [2024-11-27 23:34:48,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 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-27 23:34:48,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:48,503 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] [2024-11-27 23:34:48,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-27 23:34:48,503 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:48,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:48,504 INFO L85 PathProgramCache]: Analyzing trace with hash -695903301, now seen corresponding path program 1 times [2024-11-27 23:34:48,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:48,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332195924] [2024-11-27 23:34:48,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:48,662 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-27 23:34:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:48,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332195924] [2024-11-27 23:34:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332195924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:48,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:34:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126745010] [2024-11-27 23:34:48,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:48,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:34:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:48,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:34:48,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:34:48,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-27 23:34:48,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 673 transitions, 1545 flow. Second operand has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 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-27 23:34:48,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:48,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-27 23:34:48,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:50,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:50,539 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-27 23:34:50,539 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-27 23:34:50,539 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-27 23:34:50,539 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-27 23:34:50,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:50,568 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-27 23:34:50,568 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:34:50,568 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-27 23:34:50,568 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:34:51,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:51,276 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2024-11-27 23:34:51,276 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-27 23:34:51,276 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-27 23:34:51,276 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-27 23:34:51,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:51,292 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-11-27 23:34:51,292 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-27 23:34:51,292 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-27 23:34:51,293 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-27 23:34:51,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:51,295 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-11-27 23:34:51,295 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-27 23:34:51,295 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-27 23:34:51,295 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-27 23:34:51,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:51,312 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2024-11-27 23:34:51,312 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-27 23:34:51,312 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-27 23:34:51,312 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-27 23:34:51,417 INFO L124 PetriNetUnfolderBase]: 399/8981 cut-off events. [2024-11-27 23:34:51,417 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2024-11-27 23:34:51,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10021 conditions, 8981 events. 399/8981 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79775 event pairs, 14 based on Foata normal form. 1/7930 useless extension candidates. Maximal degree in co-relation 9793. Up to 159 conditions per place. [2024-11-27 23:34:51,543 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 7 selfloop transitions, 6 changer transitions 0/674 dead transitions. [2024-11-27 23:34:51,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 674 transitions, 1573 flow [2024-11-27 23:34:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:34:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:34:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3744 transitions. [2024-11-27 23:34:51,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9674418604651163 [2024-11-27 23:34:51,550 INFO L175 Difference]: Start difference. First operand has 648 places, 673 transitions, 1545 flow. Second operand 5 states and 3744 transitions. [2024-11-27 23:34:51,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 674 transitions, 1573 flow [2024-11-27 23:34:51,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 674 transitions, 1573 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:34:51,565 INFO L231 Difference]: Finished difference. Result has 653 places, 674 transitions, 1565 flow [2024-11-27 23:34:51,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1565, PETRI_PLACES=653, PETRI_TRANSITIONS=674} [2024-11-27 23:34:51,566 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -65 predicate places. [2024-11-27 23:34:51,566 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 674 transitions, 1565 flow [2024-11-27 23:34:51,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 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-27 23:34:51,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:51,567 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, 1, 1] [2024-11-27 23:34:51,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-27 23:34:51,568 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 898940270, now seen corresponding path program 1 times [2024-11-27 23:34:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700617899] [2024-11-27 23:34:51,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:34:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700617899] [2024-11-27 23:34:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700617899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:34:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326619596] [2024-11-27 23:34:51,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:34:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:34:51,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:34:51,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:34:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:52,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 23:34:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:34:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:34:52,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:34:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:34:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326619596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:34:52,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:34:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-27 23:34:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163632715] [2024-11-27 23:34:52,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:34:52,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 23:34:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:52,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 23:34:52,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:34:52,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-27 23:34:52,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 674 transitions, 1565 flow. Second operand has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 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-27 23:34:52,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:52,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-27 23:34:52,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:34:55,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:55,391 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-11-27 23:34:55,391 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-27 23:34:55,391 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-27 23:34:55,391 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-27 23:34:55,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:55,421 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-11-27 23:34:55,421 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-27 23:34:55,421 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-11-27 23:34:55,421 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-27 23:34:55,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:55,833 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-11-27 23:34:55,833 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-27 23:34:55,833 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-27 23:34:55,833 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-11-27 23:34:55,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:55,846 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-27 23:34:55,846 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:34:55,846 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-27 23:34:55,846 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:34:55,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:55,848 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-27 23:34:55,848 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:34:55,848 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:34:55,848 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-27 23:34:55,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:34:55,862 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-11-27 23:34:55,862 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-11-27 23:34:55,862 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-27 23:34:55,862 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-27 23:34:55,941 INFO L124 PetriNetUnfolderBase]: 399/8998 cut-off events. [2024-11-27 23:34:55,941 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2024-11-27 23:34:56,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 8998 events. 399/8998 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79869 event pairs, 14 based on Foata normal form. 2/7948 useless extension candidates. Maximal degree in co-relation 9847. Up to 159 conditions per place. [2024-11-27 23:34:56,196 INFO L140 encePairwiseOnDemand]: 764/774 looper letters, 11 selfloop transitions, 13 changer transitions 0/682 dead transitions. [2024-11-27 23:34:56,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 682 transitions, 1631 flow [2024-11-27 23:34:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:34:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-27 23:34:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8199 transitions. [2024-11-27 23:34:56,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630021141649049 [2024-11-27 23:34:56,205 INFO L175 Difference]: Start difference. First operand has 653 places, 674 transitions, 1565 flow. Second operand 11 states and 8199 transitions. [2024-11-27 23:34:56,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 682 transitions, 1631 flow [2024-11-27 23:34:56,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1621 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 23:34:56,217 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1615 flow [2024-11-27 23:34:56,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1615, PETRI_PLACES=663, PETRI_TRANSITIONS=680} [2024-11-27 23:34:56,218 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -55 predicate places. [2024-11-27 23:34:56,218 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1615 flow [2024-11-27 23:34:56,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 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-27 23:34:56,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:34:56,222 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:34:56,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:34:56,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22c5e9b0-efc9-4809-a072-fce2aad1da45/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-27 23:34:56,423 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:34:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1574369842, now seen corresponding path program 2 times [2024-11-27 23:34:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:56,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211679568] [2024-11-27 23:34:56,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:34:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:56,472 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:34:56,472 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:34:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:34:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:57,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211679568] [2024-11-27 23:34:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211679568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:34:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271127672] [2024-11-27 23:34:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:57,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:34:57,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:57,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:34:57,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:34:57,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-11-27 23:34:57,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 680 transitions, 1615 flow. Second operand has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 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-27 23:34:57,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:34:57,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-11-27 23:34:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:00,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:35:00,375 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-11-27 23:35:00,375 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-27 23:35:00,375 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-27 23:35:00,375 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-27 23:35:00,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:35:00,408 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-11-27 23:35:00,408 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-11-27 23:35:00,408 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-27 23:35:00,408 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-27 23:35:00,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:35:00,847 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-11-27 23:35:00,847 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-27 23:35:00,847 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-27 23:35:00,847 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-11-27 23:35:00,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:35:00,861 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-27 23:35:00,861 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:35:00,861 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-27 23:35:00,861 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:35:00,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:35:00,863 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-27 23:35:00,864 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:35:00,864 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-27 23:35:00,864 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-27 23:35:00,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-27 23:35:00,886 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-11-27 23:35:00,886 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-11-27 23:35:00,886 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-27 23:35:00,887 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-27 23:35:00,974 INFO L124 PetriNetUnfolderBase]: 473/10030 cut-off events. [2024-11-27 23:35:00,974 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-27 23:35:01,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 10030 events. 473/10030 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 92148 event pairs, 17 based on Foata normal form. 0/8886 useless extension candidates. Maximal degree in co-relation 11213. Up to 159 conditions per place. [2024-11-27 23:35:01,124 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/683 dead transitions. [2024-11-27 23:35:01,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1671 flow [2024-11-27 23:35:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:35:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-11-27 23:35:01,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-11-27 23:35:01,130 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1615 flow. Second operand 6 states and 4457 transitions. [2024-11-27 23:35:01,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1671 flow [2024-11-27 23:35:01,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 683 transitions, 1659 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-27 23:35:01,147 INFO L231 Difference]: Finished difference. Result has 664 places, 679 transitions, 1613 flow [2024-11-27 23:35:01,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=664, PETRI_TRANSITIONS=679} [2024-11-27 23:35:01,149 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-11-27 23:35:01,149 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 679 transitions, 1613 flow [2024-11-27 23:35:01,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 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-27 23:35:01,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:01,151 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 23:35:01,151 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash -487513711, now seen corresponding path program 1 times [2024-11-27 23:35:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143901809] [2024-11-27 23:35:01,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143901809] [2024-11-27 23:35:01,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143901809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:01,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:35:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688745782] [2024-11-27 23:35:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:01,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:35:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:01,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:35:01,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:35:01,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-27 23:35:01,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 679 transitions, 1613 flow. Second operand has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 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-27 23:35:01,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:01,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-27 23:35:01,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:06,276 INFO L124 PetriNetUnfolderBase]: 649/12848 cut-off events. [2024-11-27 23:35:06,276 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-27 23:35:06,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 12848 events. 649/12848 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 126944 event pairs, 42 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 14420. Up to 283 conditions per place. [2024-11-27 23:35:06,412 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 12 selfloop transitions, 8 changer transitions 0/687 dead transitions. [2024-11-27 23:35:06,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 687 transitions, 1672 flow [2024-11-27 23:35:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:35:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:35:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3751 transitions. [2024-11-27 23:35:06,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969250645994832 [2024-11-27 23:35:06,416 INFO L175 Difference]: Start difference. First operand has 664 places, 679 transitions, 1613 flow. Second operand 5 states and 3751 transitions. [2024-11-27 23:35:06,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 687 transitions, 1672 flow [2024-11-27 23:35:06,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 23:35:06,434 INFO L231 Difference]: Finished difference. Result has 666 places, 683 transitions, 1647 flow [2024-11-27 23:35:06,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=683} [2024-11-27 23:35:06,435 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-11-27 23:35:06,435 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 683 transitions, 1647 flow [2024-11-27 23:35:06,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 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-27 23:35:06,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:06,437 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:06,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-27 23:35:06,437 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:06,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1491273475, now seen corresponding path program 1 times [2024-11-27 23:35:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:06,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835826010] [2024-11-27 23:35:06,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:06,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835826010] [2024-11-27 23:35:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835826010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372051908] [2024-11-27 23:35:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:06,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:06,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:06,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:06,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:35:06,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 683 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-27 23:35:06,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:06,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:35:06,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:11,439 INFO L124 PetriNetUnfolderBase]: 731/12842 cut-off events. [2024-11-27 23:35:11,439 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2024-11-27 23:35:11,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 12842 events. 731/12842 cut-off events. For 633/637 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 129554 event pairs, 103 based on Foata normal form. 0/11329 useless extension candidates. Maximal degree in co-relation 14980. Up to 611 conditions per place. [2024-11-27 23:35:11,582 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 16 selfloop transitions, 3 changer transitions 1/683 dead transitions. [2024-11-27 23:35:11,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1688 flow [2024-11-27 23:35:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:35:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-27 23:35:11,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-27 23:35:11,585 INFO L175 Difference]: Start difference. First operand has 666 places, 683 transitions, 1647 flow. Second operand 3 states and 2237 transitions. [2024-11-27 23:35:11,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1688 flow [2024-11-27 23:35:11,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1688 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:35:11,596 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1651 flow [2024-11-27 23:35:11,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=667, PETRI_TRANSITIONS=682} [2024-11-27 23:35:11,598 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -51 predicate places. [2024-11-27 23:35:11,598 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1651 flow [2024-11-27 23:35:11,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-27 23:35:11,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:11,599 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-27 23:35:11,599 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1158886635, now seen corresponding path program 1 times [2024-11-27 23:35:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:11,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754809096] [2024-11-27 23:35:11,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:11,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754809096] [2024-11-27 23:35:11,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754809096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:11,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:11,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921936832] [2024-11-27 23:35:11,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:11,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:11,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:11,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:11,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-11-27 23:35:11,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 682 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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-27 23:35:11,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:11,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-11-27 23:35:11,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:15,397 INFO L124 PetriNetUnfolderBase]: 567/11726 cut-off events. [2024-11-27 23:35:15,397 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2024-11-27 23:35:15,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13549 conditions, 11726 events. 567/11726 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 110211 event pairs, 52 based on Foata normal form. 0/10408 useless extension candidates. Maximal degree in co-relation 13327. Up to 253 conditions per place. [2024-11-27 23:35:15,567 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2024-11-27 23:35:15,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 682 transitions, 1678 flow [2024-11-27 23:35:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:35:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-11-27 23:35:15,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-11-27 23:35:15,570 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1651 flow. Second operand 3 states and 2249 transitions. [2024-11-27 23:35:15,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 682 transitions, 1678 flow [2024-11-27 23:35:15,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 682 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:35:15,591 INFO L231 Difference]: Finished difference. Result has 666 places, 681 transitions, 1647 flow [2024-11-27 23:35:15,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=681} [2024-11-27 23:35:15,593 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-11-27 23:35:15,593 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 681 transitions, 1647 flow [2024-11-27 23:35:15,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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-27 23:35:15,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:15,595 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:15,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-27 23:35:15,595 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1736515266, now seen corresponding path program 1 times [2024-11-27 23:35:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468901073] [2024-11-27 23:35:15,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468901073] [2024-11-27 23:35:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468901073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:35:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463746569] [2024-11-27 23:35:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:16,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:35:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:16,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:35:16,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:17,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-11-27 23:35:17,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 681 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 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-27 23:35:17,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:17,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-11-27 23:35:17,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:21,357 INFO L124 PetriNetUnfolderBase]: 670/12757 cut-off events. [2024-11-27 23:35:21,357 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2024-11-27 23:35:21,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14903 conditions, 12757 events. 670/12757 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 127086 event pairs, 30 based on Foata normal form. 0/11365 useless extension candidates. Maximal degree in co-relation 14667. Up to 283 conditions per place. [2024-11-27 23:35:21,529 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2024-11-27 23:35:21,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 684 transitions, 1703 flow [2024-11-27 23:35:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:35:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-11-27 23:35:21,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-11-27 23:35:21,535 INFO L175 Difference]: Start difference. First operand has 666 places, 681 transitions, 1647 flow. Second operand 6 states and 4457 transitions. [2024-11-27 23:35:21,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 684 transitions, 1703 flow [2024-11-27 23:35:21,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:35:21,551 INFO L231 Difference]: Finished difference. Result has 668 places, 680 transitions, 1653 flow [2024-11-27 23:35:21,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=668, PETRI_TRANSITIONS=680} [2024-11-27 23:35:21,554 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -50 predicate places. [2024-11-27 23:35:21,554 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 680 transitions, 1653 flow [2024-11-27 23:35:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 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-27 23:35:21,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:21,555 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:21,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-27 23:35:21,556 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1774963750, now seen corresponding path program 1 times [2024-11-27 23:35:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814584616] [2024-11-27 23:35:21,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814584616] [2024-11-27 23:35:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814584616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627554834] [2024-11-27 23:35:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:21,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:21,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:21,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-11-27 23:35:21,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 680 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-27 23:35:21,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:21,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-11-27 23:35:21,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:26,720 INFO L124 PetriNetUnfolderBase]: 653/13672 cut-off events. [2024-11-27 23:35:26,721 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2024-11-27 23:35:26,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15987 conditions, 13672 events. 653/13672 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 130440 event pairs, 26 based on Foata normal form. 0/12248 useless extension candidates. Maximal degree in co-relation 15765. Up to 313 conditions per place. [2024-11-27 23:35:26,871 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 14 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2024-11-27 23:35:26,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 679 transitions, 1685 flow [2024-11-27 23:35:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:35:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2024-11-27 23:35:26,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659776055124892 [2024-11-27 23:35:26,874 INFO L175 Difference]: Start difference. First operand has 668 places, 680 transitions, 1653 flow. Second operand 3 states and 2243 transitions. [2024-11-27 23:35:26,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 679 transitions, 1685 flow [2024-11-27 23:35:26,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1673 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 23:35:26,892 INFO L231 Difference]: Finished difference. Result has 662 places, 677 transitions, 1643 flow [2024-11-27 23:35:26,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=677} [2024-11-27 23:35:26,893 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-11-27 23:35:26,894 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 677 transitions, 1643 flow [2024-11-27 23:35:26,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-27 23:35:26,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:26,895 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:26,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-27 23:35:26,895 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1953064777, now seen corresponding path program 1 times [2024-11-27 23:35:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:26,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903608147] [2024-11-27 23:35:26,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903608147] [2024-11-27 23:35:26,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903608147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:26,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451772231] [2024-11-27 23:35:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:26,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:26,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:26,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:27,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-11-27 23:35:27,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 677 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-27 23:35:27,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:27,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-11-27 23:35:27,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:30,816 INFO L124 PetriNetUnfolderBase]: 687/12102 cut-off events. [2024-11-27 23:35:30,816 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2024-11-27 23:35:30,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14276 conditions, 12102 events. 687/12102 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 120762 event pairs, 82 based on Foata normal form. 0/10846 useless extension candidates. Maximal degree in co-relation 14053. Up to 434 conditions per place. [2024-11-27 23:35:30,970 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2024-11-27 23:35:30,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 677 transitions, 1670 flow [2024-11-27 23:35:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:35:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-11-27 23:35:30,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-11-27 23:35:30,973 INFO L175 Difference]: Start difference. First operand has 662 places, 677 transitions, 1643 flow. Second operand 3 states and 2249 transitions. [2024-11-27 23:35:30,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 677 transitions, 1670 flow [2024-11-27 23:35:30,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 677 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:35:30,984 INFO L231 Difference]: Finished difference. Result has 662 places, 676 transitions, 1643 flow [2024-11-27 23:35:30,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=676} [2024-11-27 23:35:30,985 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-11-27 23:35:30,985 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 676 transitions, 1643 flow [2024-11-27 23:35:30,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-27 23:35:30,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:30,986 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:30,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-27 23:35:30,986 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -882789554, now seen corresponding path program 1 times [2024-11-27 23:35:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648708532] [2024-11-27 23:35:30,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648708532] [2024-11-27 23:35:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648708532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:31,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938183904] [2024-11-27 23:35:31,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:31,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:31,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:31,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:31,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-11-27 23:35:31,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 676 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-27 23:35:31,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:31,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-11-27 23:35:31,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:35,626 INFO L124 PetriNetUnfolderBase]: 693/11895 cut-off events. [2024-11-27 23:35:35,626 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2024-11-27 23:35:35,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 11895 events. 693/11895 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 118791 event pairs, 30 based on Foata normal form. 0/10840 useless extension candidates. Maximal degree in co-relation 13979. Up to 520 conditions per place. [2024-11-27 23:35:35,794 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-11-27 23:35:35,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1672 flow [2024-11-27 23:35:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:35:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-27 23:35:35,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-11-27 23:35:35,796 INFO L175 Difference]: Start difference. First operand has 662 places, 676 transitions, 1643 flow. Second operand 3 states and 2242 transitions. [2024-11-27 23:35:35,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1672 flow [2024-11-27 23:35:35,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:35:35,809 INFO L231 Difference]: Finished difference. Result has 659 places, 673 transitions, 1641 flow [2024-11-27 23:35:35,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=659, PETRI_TRANSITIONS=673} [2024-11-27 23:35:35,810 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-27 23:35:35,810 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 673 transitions, 1641 flow [2024-11-27 23:35:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-27 23:35:35,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:35,812 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:35,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-27 23:35:35,812 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1663872136, now seen corresponding path program 1 times [2024-11-27 23:35:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473183353] [2024-11-27 23:35:35,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473183353] [2024-11-27 23:35:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473183353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971961322] [2024-11-27 23:35:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:36,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:36,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:36,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:36,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:35:36,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 673 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-27 23:35:36,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:36,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:35:36,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:35:41,600 INFO L124 PetriNetUnfolderBase]: 825/17128 cut-off events. [2024-11-27 23:35:41,600 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-27 23:35:41,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 17128 events. 825/17128 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 177830 event pairs, 75 based on Foata normal form. 0/15687 useless extension candidates. Maximal degree in co-relation 19793. Up to 418 conditions per place. [2024-11-27 23:35:41,789 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-11-27 23:35:41,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 673 transitions, 1682 flow [2024-11-27 23:35:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:35:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-27 23:35:41,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-27 23:35:41,794 INFO L175 Difference]: Start difference. First operand has 659 places, 673 transitions, 1641 flow. Second operand 3 states and 2237 transitions. [2024-11-27 23:35:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 673 transitions, 1682 flow [2024-11-27 23:35:41,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:35:41,826 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2024-11-27 23:35:41,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-11-27 23:35:41,828 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-27 23:35:41,828 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2024-11-27 23:35:41,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-27 23:35:41,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:35:41,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:35:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-27 23:35:41,830 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-27 23:35:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash -912190852, now seen corresponding path program 1 times [2024-11-27 23:35:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139148323] [2024-11-27 23:35:41,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-27 23:35:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139148323] [2024-11-27 23:35:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139148323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102810481] [2024-11-27 23:35:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:41,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:41,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:41,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:42,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-27 23:35:42,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-27 23:35:42,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:35:42,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-27 23:35:42,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand