./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i --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_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1 --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 fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:58:56,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:58:56,548 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-02 11:58:56,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:58:56,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:58:56,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:58:56,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:58:56,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:58:56,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:58:56,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:58:56,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:58:56,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:58:56,584 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:58:56,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:58:56,585 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:58:56,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:58:56,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:58:56,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:58:56,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:58:56,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:58:56,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:58:56,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:58:56,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:58:56,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:58:56,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:58:56,589 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_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1 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 -> fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 [2024-12-02 11:58:56,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:58:56,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:58:56,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:58:56,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:58:56,858 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:58:56,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2024-12-02 11:59:00,182 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/data/8ab9a0b8f/75e873b6facf43feb89172778156fef8/FLAGfd35e7f64 [2024-12-02 11:59:00,454 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:59:00,455 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2024-12-02 11:59:00,471 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/data/8ab9a0b8f/75e873b6facf43feb89172778156fef8/FLAGfd35e7f64 [2024-12-02 11:59:00,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/data/8ab9a0b8f/75e873b6facf43feb89172778156fef8 [2024-12-02 11:59:00,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:59:00,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:59:00,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:59:00,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:59:00,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:59:00,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:00,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c86958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00, skipping insertion in model container [2024-12-02 11:59:00,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:00,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:59:00,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:59:00,892 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:59:00,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:59:00,988 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:59:00,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00 WrapperNode [2024-12-02 11:59:00,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:59:00,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:59:00,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:59:00,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:59:00,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,032 INFO L138 Inliner]: procedures = 158, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2024-12-02 11:59:01,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:59:01,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:59:01,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:59:01,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:59:01,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:59:01,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:59:01,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:59:01,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:59:01,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (1/1) ... [2024-12-02 11:59:01,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:59:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:59:01,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:59:01,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:59:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 11:59:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 11:59:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-02 11:59:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:59:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 11:59:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 11:59:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 11:59:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-12-02 11:59:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-12-02 11:59:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-02 11:59:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:59:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:59:01,127 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 11:59:01,255 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:59:01,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:59:01,491 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 11:59:01,492 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:59:01,513 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:59:01,513 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 11:59:01,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:01 BoogieIcfgContainer [2024-12-02 11:59:01,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:59:01,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:59:01,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:59:01,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:59:01,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:59:00" (1/3) ... [2024-12-02 11:59:01,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da06fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:59:01, skipping insertion in model container [2024-12-02 11:59:01,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:00" (2/3) ... [2024-12-02 11:59:01,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da06fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:59:01, skipping insertion in model container [2024-12-02 11:59:01,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:01" (3/3) ... [2024-12-02 11:59:01,525 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.i [2024-12-02 11:59:01,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:59:01,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-3.i that has 2 procedures, 90 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2024-12-02 11:59:01,546 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 11:59:01,617 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-02 11:59:01,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 111 transitions, 236 flow [2024-12-02 11:59:01,768 INFO L124 PetriNetUnfolderBase]: 8/225 cut-off events. [2024-12-02 11:59:01,770 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-02 11:59:01,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 225 events. 8/225 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 600 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2024-12-02 11:59:01,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 111 transitions, 236 flow [2024-12-02 11:59:01,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 110 transitions, 233 flow [2024-12-02 11:59:01,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:59:01,808 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;@5b3cb2c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:59:01,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-12-02 11:59:01,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:59:01,823 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-12-02 11:59:01,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:59:01,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:01,824 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] [2024-12-02 11:59:01,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 11:59:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1963547741, now seen corresponding path program 1 times [2024-12-02 11:59:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340118813] [2024-12-02 11:59:01,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340118813] [2024-12-02 11:59:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340118813] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:59:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118572804] [2024-12-02 11:59:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:02,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:02,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:02,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 111 [2024-12-02 11:59:02,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 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-12-02 11:59:02,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:02,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 111 [2024-12-02 11:59:02,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:03,228 INFO L124 PetriNetUnfolderBase]: 138/786 cut-off events. [2024-12-02 11:59:03,229 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-12-02 11:59:03,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 786 events. 138/786 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4942 event pairs, 87 based on Foata normal form. 18/720 useless extension candidates. Maximal degree in co-relation 826. Up to 276 conditions per place. [2024-12-02 11:59:03,238 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 33 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2024-12-02 11:59:03,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 319 flow [2024-12-02 11:59:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:59:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 11:59:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 509 transitions. [2024-12-02 11:59:03,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7642642642642643 [2024-12-02 11:59:03,258 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 233 flow. Second operand 6 states and 509 transitions. [2024-12-02 11:59:03,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 319 flow [2024-12-02 11:59:03,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:03,270 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 233 flow [2024-12-02 11:59:03,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2024-12-02 11:59:03,278 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2024-12-02 11:59:03,278 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 233 flow [2024-12-02 11:59:03,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 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-12-02 11:59:03,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:03,279 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] [2024-12-02 11:59:03,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:59:03,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 11:59:03,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 435754808, now seen corresponding path program 1 times [2024-12-02 11:59:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709452791] [2024-12-02 11:59:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:03,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709452791] [2024-12-02 11:59:03,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709452791] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:03,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:03,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:59:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818330563] [2024-12-02 11:59:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:03,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:59:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:03,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:59:03,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:59:03,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2024-12-02 11:59:03,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-12-02 11:59:03,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:03,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2024-12-02 11:59:03,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:03,509 INFO L124 PetriNetUnfolderBase]: 33/416 cut-off events. [2024-12-02 11:59:03,510 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-12-02 11:59:03,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 416 events. 33/416 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1804 event pairs, 9 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 459. Up to 43 conditions per place. [2024-12-02 11:59:03,513 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 17 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2024-12-02 11:59:03,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 287 flow [2024-12-02 11:59:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:59:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:59:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2024-12-02 11:59:03,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963963963963963 [2024-12-02 11:59:03,516 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 233 flow. Second operand 4 states and 398 transitions. [2024-12-02 11:59:03,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 287 flow [2024-12-02 11:59:03,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 11:59:03,521 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 235 flow [2024-12-02 11:59:03,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-12-02 11:59:03,522 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2024-12-02 11:59:03,522 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 235 flow [2024-12-02 11:59:03,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-12-02 11:59:03,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:03,522 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] [2024-12-02 11:59:03,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:59:03,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 11:59:03,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash 250659041, now seen corresponding path program 1 times [2024-12-02 11:59:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:03,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477142047] [2024-12-02 11:59:03,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477142047] [2024-12-02 11:59:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477142047] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222234103] [2024-12-02 11:59:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:03,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:03,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:03,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2024-12-02 11:59:03,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-12-02 11:59:03,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:03,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2024-12-02 11:59:03,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:03,782 INFO L124 PetriNetUnfolderBase]: 112/709 cut-off events. [2024-12-02 11:59:03,782 INFO L125 PetriNetUnfolderBase]: For 28/38 co-relation queries the response was YES. [2024-12-02 11:59:03,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 709 events. 112/709 cut-off events. For 28/38 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4272 event pairs, 59 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 910. Up to 182 conditions per place. [2024-12-02 11:59:03,789 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 18 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2024-12-02 11:59:03,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 299 flow [2024-12-02 11:59:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2024-12-02 11:59:03,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2024-12-02 11:59:03,791 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 235 flow. Second operand 3 states and 306 transitions. [2024-12-02 11:59:03,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 299 flow [2024-12-02 11:59:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 115 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 11:59:03,795 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 265 flow [2024-12-02 11:59:03,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2024-12-02 11:59:03,796 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2024-12-02 11:59:03,797 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 265 flow [2024-12-02 11:59:03,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-12-02 11:59:03,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:03,797 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:03,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:59:03,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 11:59:03,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash 849469352, now seen corresponding path program 1 times [2024-12-02 11:59:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:03,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106631488] [2024-12-02 11:59:03,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:59:03,829 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:59:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:59:03,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:59:03,868 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:59:03,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-12-02 11:59:03,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-12-02 11:59:03,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-12-02 11:59:03,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-12-02 11:59:03,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-12-02 11:59:03,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-12-02 11:59:03,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-12-02 11:59:03,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-12-02 11:59:03,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-12-02 11:59:03,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:59:03,872 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-12-02 11:59:03,875 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 11:59:03,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-02 11:59:03,910 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-02 11:59:03,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 147 transitions, 326 flow [2024-12-02 11:59:03,981 INFO L124 PetriNetUnfolderBase]: 18/397 cut-off events. [2024-12-02 11:59:03,982 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-12-02 11:59:03,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 397 events. 18/397 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1338 event pairs, 1 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 420. Up to 16 conditions per place. [2024-12-02 11:59:03,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 147 transitions, 326 flow [2024-12-02 11:59:03,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 128 transitions, 278 flow [2024-12-02 11:59:03,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:59:03,988 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;@5b3cb2c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:59:03,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-12-02 11:59:03,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:59:03,993 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-12-02 11:59:03,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:59:03,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:03,993 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] [2024-12-02 11:59:03,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 11:59:03,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash 666311135, now seen corresponding path program 1 times [2024-12-02 11:59:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:03,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287125865] [2024-12-02 11:59:03,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:04,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287125865] [2024-12-02 11:59:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287125865] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:59:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426446686] [2024-12-02 11:59:04,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:04,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:04,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:04,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:04,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 147 [2024-12-02 11:59:04,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:59:04,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:04,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 147 [2024-12-02 11:59:04,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:05,461 INFO L124 PetriNetUnfolderBase]: 879/3345 cut-off events. [2024-12-02 11:59:05,461 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-12-02 11:59:05,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 3345 events. 879/3345 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 29207 event pairs, 505 based on Foata normal form. 72/3093 useless extension candidates. Maximal degree in co-relation 1438. Up to 1365 conditions per place. [2024-12-02 11:59:05,485 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 45 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2024-12-02 11:59:05,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 404 flow [2024-12-02 11:59:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:59:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 11:59:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 689 transitions. [2024-12-02 11:59:05,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7811791383219955 [2024-12-02 11:59:05,489 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 278 flow. Second operand 6 states and 689 transitions. [2024-12-02 11:59:05,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 404 flow [2024-12-02 11:59:05,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:05,494 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 278 flow [2024-12-02 11:59:05,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2024-12-02 11:59:05,495 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 2 predicate places. [2024-12-02 11:59:05,495 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 278 flow [2024-12-02 11:59:05,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:59:05,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:05,496 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] [2024-12-02 11:59:05,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:59:05,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 11:59:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1123874184, now seen corresponding path program 1 times [2024-12-02 11:59:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117589112] [2024-12-02 11:59:05,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:05,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117589112] [2024-12-02 11:59:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117589112] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:05,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:05,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:59:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307471167] [2024-12-02 11:59:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:05,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:59:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:05,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:59:05,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:59:05,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 147 [2024-12-02 11:59:05,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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-12-02 11:59:05,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:05,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 147 [2024-12-02 11:59:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:05,888 INFO L124 PetriNetUnfolderBase]: 253/1589 cut-off events. [2024-12-02 11:59:05,889 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-12-02 11:59:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 1589 events. 253/1589 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11752 event pairs, 101 based on Foata normal form. 1/1437 useless extension candidates. Maximal degree in co-relation 1094. Up to 267 conditions per place. [2024-12-02 11:59:05,902 INFO L140 encePairwiseOnDemand]: 142/147 looper letters, 24 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-12-02 11:59:05,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 352 flow [2024-12-02 11:59:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:59:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:59:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2024-12-02 11:59:05,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8792517006802721 [2024-12-02 11:59:05,904 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 278 flow. Second operand 4 states and 517 transitions. [2024-12-02 11:59:05,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 352 flow [2024-12-02 11:59:05,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 342 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 11:59:05,908 INFO L231 Difference]: Finished difference. Result has 132 places, 126 transitions, 284 flow [2024-12-02 11:59:05,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=132, PETRI_TRANSITIONS=126} [2024-12-02 11:59:05,909 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2024-12-02 11:59:05,909 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 126 transitions, 284 flow [2024-12-02 11:59:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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-12-02 11:59:05,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:05,910 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] [2024-12-02 11:59:05,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:59:05,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 11:59:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 304402707, now seen corresponding path program 1 times [2024-12-02 11:59:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967461079] [2024-12-02 11:59:05,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967461079] [2024-12-02 11:59:05,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967461079] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:05,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:05,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:05,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589289859] [2024-12-02 11:59:05,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:05,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:05,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:05,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:05,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:05,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2024-12-02 11:59:05,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 126 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-12-02 11:59:05,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:05,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2024-12-02 11:59:05,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:06,617 INFO L124 PetriNetUnfolderBase]: 1070/3962 cut-off events. [2024-12-02 11:59:06,617 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2024-12-02 11:59:06,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 3962 events. 1070/3962 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 37261 event pairs, 701 based on Foata normal form. 0/3518 useless extension candidates. Maximal degree in co-relation 5709. Up to 1393 conditions per place. [2024-12-02 11:59:06,652 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 27 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2024-12-02 11:59:06,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 386 flow [2024-12-02 11:59:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-12-02 11:59:06,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8934240362811792 [2024-12-02 11:59:06,655 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 284 flow. Second operand 3 states and 394 transitions. [2024-12-02 11:59:06,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 386 flow [2024-12-02 11:59:06,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:06,660 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 324 flow [2024-12-02 11:59:06,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-12-02 11:59:06,661 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2024-12-02 11:59:06,661 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 324 flow [2024-12-02 11:59:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-12-02 11:59:06,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:06,661 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] [2024-12-02 11:59:06,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:59:06,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 11:59:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1421180332, now seen corresponding path program 1 times [2024-12-02 11:59:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485634028] [2024-12-02 11:59:06,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:59:06,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:06,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485634028] [2024-12-02 11:59:06,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485634028] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:06,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:06,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:59:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006243864] [2024-12-02 11:59:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:06,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:06,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:06,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:06,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2024-12-02 11:59:06,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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-12-02 11:59:06,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:06,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2024-12-02 11:59:06,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:07,491 INFO L124 PetriNetUnfolderBase]: 640/3440 cut-off events. [2024-12-02 11:59:07,491 INFO L125 PetriNetUnfolderBase]: For 292/304 co-relation queries the response was YES. [2024-12-02 11:59:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 3440 events. 640/3440 cut-off events. For 292/304 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 31096 event pairs, 147 based on Foata normal form. 3/2997 useless extension candidates. Maximal degree in co-relation 2772. Up to 401 conditions per place. [2024-12-02 11:59:07,522 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 33 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2024-12-02 11:59:07,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 440 flow [2024-12-02 11:59:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:59:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:59:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2024-12-02 11:59:07,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561710398445093 [2024-12-02 11:59:07,526 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 324 flow. Second operand 7 states and 881 transitions. [2024-12-02 11:59:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 440 flow [2024-12-02 11:59:07,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:07,531 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 342 flow [2024-12-02 11:59:07,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2024-12-02 11:59:07,532 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 10 predicate places. [2024-12-02 11:59:07,532 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 342 flow [2024-12-02 11:59:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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-12-02 11:59:07,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:07,533 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:07,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:59:07,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 11:59:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash -308274786, now seen corresponding path program 1 times [2024-12-02 11:59:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566600103] [2024-12-02 11:59:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 11:59:07,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566600103] [2024-12-02 11:59:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566600103] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24551289] [2024-12-02 11:59:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:07,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:07,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:07,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:07,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2024-12-02 11:59:07,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:59:07,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:07,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2024-12-02 11:59:07,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:08,318 INFO L124 PetriNetUnfolderBase]: 1661/6017 cut-off events. [2024-12-02 11:59:08,318 INFO L125 PetriNetUnfolderBase]: For 1158/1202 co-relation queries the response was YES. [2024-12-02 11:59:08,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 6017 events. 1661/6017 cut-off events. For 1158/1202 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 60245 event pairs, 951 based on Foata normal form. 2/5317 useless extension candidates. Maximal degree in co-relation 9889. Up to 2039 conditions per place. [2024-12-02 11:59:08,358 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 28 selfloop transitions, 9 changer transitions 0/147 dead transitions. [2024-12-02 11:59:08,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 459 flow [2024-12-02 11:59:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-12-02 11:59:08,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.891156462585034 [2024-12-02 11:59:08,360 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 342 flow. Second operand 3 states and 393 transitions. [2024-12-02 11:59:08,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 459 flow [2024-12-02 11:59:08,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 449 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-12-02 11:59:08,372 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 408 flow [2024-12-02 11:59:08,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2024-12-02 11:59:08,373 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 11 predicate places. [2024-12-02 11:59:08,373 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 408 flow [2024-12-02 11:59:08,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:59:08,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:08,374 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:08,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:59:08,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 11:59:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 607409237, now seen corresponding path program 1 times [2024-12-02 11:59:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360998097] [2024-12-02 11:59:08,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:59:08,409 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:59:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:59:08,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:59:08,437 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:59:08,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-12-02 11:59:08,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-12-02 11:59:08,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-12-02 11:59:08,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:59:08,439 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-12-02 11:59:08,439 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 11:59:08,440 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-02 11:59:08,488 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-12-02 11:59:08,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 183 transitions, 420 flow [2024-12-02 11:59:08,610 INFO L124 PetriNetUnfolderBase]: 40/677 cut-off events. [2024-12-02 11:59:08,610 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-12-02 11:59:08,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 677 events. 40/677 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2751 event pairs, 6 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 726. Up to 32 conditions per place. [2024-12-02 11:59:08,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 183 transitions, 420 flow [2024-12-02 11:59:08,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 146 transitions, 325 flow [2024-12-02 11:59:08,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:59:08,618 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;@5b3cb2c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:59:08,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-12-02 11:59:08,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:59:08,621 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-12-02 11:59:08,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:59:08,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:08,621 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] [2024-12-02 11:59:08,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1452695163, now seen corresponding path program 1 times [2024-12-02 11:59:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351879314] [2024-12-02 11:59:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351879314] [2024-12-02 11:59:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351879314] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:08,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:08,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:59:08,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689580286] [2024-12-02 11:59:08,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:08,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:08,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:09,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 183 [2024-12-02 11:59:09,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 146 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 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-12-02 11:59:09,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:09,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 183 [2024-12-02 11:59:09,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:10,704 INFO L124 PetriNetUnfolderBase]: 4640/13687 cut-off events. [2024-12-02 11:59:10,704 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2024-12-02 11:59:10,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21098 conditions, 13687 events. 4640/13687 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 142716 event pairs, 2591 based on Foata normal form. 286/12868 useless extension candidates. Maximal degree in co-relation 4944. Up to 6402 conditions per place. [2024-12-02 11:59:10,786 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 57 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2024-12-02 11:59:10,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 491 flow [2024-12-02 11:59:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:59:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 11:59:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2024-12-02 11:59:10,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914389799635702 [2024-12-02 11:59:10,789 INFO L175 Difference]: Start difference. First operand has 150 places, 146 transitions, 325 flow. Second operand 6 states and 869 transitions. [2024-12-02 11:59:10,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 491 flow [2024-12-02 11:59:10,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 167 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:10,794 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 325 flow [2024-12-02 11:59:10,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2024-12-02 11:59:10,795 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2024-12-02 11:59:10,795 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 325 flow [2024-12-02 11:59:10,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 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-12-02 11:59:10,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:10,796 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] [2024-12-02 11:59:10,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:59:10,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1906407480, now seen corresponding path program 1 times [2024-12-02 11:59:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571159201] [2024-12-02 11:59:10,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571159201] [2024-12-02 11:59:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571159201] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:59:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938516719] [2024-12-02 11:59:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:10,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:59:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:10,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:59:10,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:59:10,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2024-12-02 11:59:10,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:59:10,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:10,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2024-12-02 11:59:10,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:11,788 INFO L124 PetriNetUnfolderBase]: 1406/6341 cut-off events. [2024-12-02 11:59:11,788 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2024-12-02 11:59:11,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 6341 events. 1406/6341 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 62193 event pairs, 529 based on Foata normal form. 1/5734 useless extension candidates. Maximal degree in co-relation 2746. Up to 1304 conditions per place. [2024-12-02 11:59:11,834 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2024-12-02 11:59:11,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 415 flow [2024-12-02 11:59:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:59:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:59:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2024-12-02 11:59:11,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674863387978142 [2024-12-02 11:59:11,836 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 325 flow. Second operand 4 states and 635 transitions. [2024-12-02 11:59:11,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 415 flow [2024-12-02 11:59:11,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 405 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 11:59:11,840 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 331 flow [2024-12-02 11:59:11,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2024-12-02 11:59:11,841 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 1 predicate places. [2024-12-02 11:59:11,841 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 331 flow [2024-12-02 11:59:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:59:11,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:11,841 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] [2024-12-02 11:59:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:59:11,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1525091609, now seen corresponding path program 1 times [2024-12-02 11:59:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925783486] [2024-12-02 11:59:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925783486] [2024-12-02 11:59:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925783486] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:11,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088871715] [2024-12-02 11:59:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:11,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:11,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:11,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:11,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 183 [2024-12-02 11:59:11,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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-12-02 11:59:11,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:11,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 183 [2024-12-02 11:59:11,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:14,453 INFO L124 PetriNetUnfolderBase]: 7632/23898 cut-off events. [2024-12-02 11:59:14,453 INFO L125 PetriNetUnfolderBase]: For 2848/2936 co-relation queries the response was YES. [2024-12-02 11:59:14,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35893 conditions, 23898 events. 7632/23898 cut-off events. For 2848/2936 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 284305 event pairs, 4688 based on Foata normal form. 3/21137 useless extension candidates. Maximal degree in co-relation 35344. Up to 8983 conditions per place. [2024-12-02 11:59:14,591 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 36 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2024-12-02 11:59:14,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 473 flow [2024-12-02 11:59:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2024-12-02 11:59:14,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2024-12-02 11:59:14,593 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 331 flow. Second operand 3 states and 482 transitions. [2024-12-02 11:59:14,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 473 flow [2024-12-02 11:59:14,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:14,604 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 379 flow [2024-12-02 11:59:14,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=153, PETRI_TRANSITIONS=150} [2024-12-02 11:59:14,605 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 3 predicate places. [2024-12-02 11:59:14,605 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 379 flow [2024-12-02 11:59:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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-12-02 11:59:14,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:14,605 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] [2024-12-02 11:59:14,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:59:14,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:14,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1509038478, now seen corresponding path program 1 times [2024-12-02 11:59:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:14,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412593787] [2024-12-02 11:59:14,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:14,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 11:59:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412593787] [2024-12-02 11:59:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412593787] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:14,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:14,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:59:14,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650211280] [2024-12-02 11:59:14,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:14,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:14,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:14,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:14,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2024-12-02 11:59:14,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 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-12-02 11:59:14,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:14,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2024-12-02 11:59:14,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:17,660 INFO L124 PetriNetUnfolderBase]: 4543/18575 cut-off events. [2024-12-02 11:59:17,661 INFO L125 PetriNetUnfolderBase]: For 1933/2089 co-relation queries the response was YES. [2024-12-02 11:59:17,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27207 conditions, 18575 events. 4543/18575 cut-off events. For 1933/2089 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 225732 event pairs, 1506 based on Foata normal form. 3/15943 useless extension candidates. Maximal degree in co-relation 7600. Up to 2942 conditions per place. [2024-12-02 11:59:17,773 INFO L140 encePairwiseOnDemand]: 176/183 looper letters, 41 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2024-12-02 11:59:17,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 172 transitions, 521 flow [2024-12-02 11:59:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:59:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:59:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2024-12-02 11:59:17,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8469945355191257 [2024-12-02 11:59:17,778 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 379 flow. Second operand 7 states and 1085 transitions. [2024-12-02 11:59:17,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 172 transitions, 521 flow [2024-12-02 11:59:17,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:17,790 INFO L231 Difference]: Finished difference. Result has 160 places, 153 transitions, 401 flow [2024-12-02 11:59:17,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=160, PETRI_TRANSITIONS=153} [2024-12-02 11:59:17,791 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2024-12-02 11:59:17,791 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 153 transitions, 401 flow [2024-12-02 11:59:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 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-12-02 11:59:17,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:17,792 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:17,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:59:17,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:17,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:17,793 INFO L85 PathProgramCache]: Analyzing trace with hash -509902562, now seen corresponding path program 1 times [2024-12-02 11:59:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:17,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492352421] [2024-12-02 11:59:17,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 11:59:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492352421] [2024-12-02 11:59:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492352421] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343172109] [2024-12-02 11:59:17,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:17,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:17,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:17,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:17,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:17,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 183 [2024-12-02 11:59:17,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 153 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-12-02 11:59:17,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:17,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 183 [2024-12-02 11:59:17,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:21,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [59#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 115#L699-1true, 182#true, 180#true, 165#L685-6true, 11#$Ultimate##0true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2024-12-02 11:59:21,414 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [59#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 66#L684-3true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 115#L699-1true, 182#true, 180#true, 165#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2024-12-02 11:59:21,415 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-02 11:59:21,415 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-12-02 11:59:21,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [59#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 115#L699-1true, 27#L686-3true, 180#true, 165#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2024-12-02 11:59:21,961 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [59#L685-6true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 115#L699-1true, 180#true, 165#L685-6true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), 163#L685-5true]) [2024-12-02 11:59:21,961 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-12-02 11:59:21,961 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-12-02 11:59:22,928 INFO L124 PetriNetUnfolderBase]: 13096/40137 cut-off events. [2024-12-02 11:59:22,928 INFO L125 PetriNetUnfolderBase]: For 9630/10383 co-relation queries the response was YES. [2024-12-02 11:59:23,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67560 conditions, 40137 events. 13096/40137 cut-off events. For 9630/10383 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 515494 event pairs, 6801 based on Foata normal form. 29/35212 useless extension candidates. Maximal degree in co-relation 66468. Up to 14649 conditions per place. [2024-12-02 11:59:23,192 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 38 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2024-12-02 11:59:23,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 568 flow [2024-12-02 11:59:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2024-12-02 11:59:23,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761384335154827 [2024-12-02 11:59:23,193 INFO L175 Difference]: Start difference. First operand has 160 places, 153 transitions, 401 flow. Second operand 3 states and 481 transitions. [2024-12-02 11:59:23,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 173 transitions, 568 flow [2024-12-02 11:59:23,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 173 transitions, 558 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-12-02 11:59:23,220 INFO L231 Difference]: Finished difference. Result has 161 places, 162 transitions, 487 flow [2024-12-02 11:59:23,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=161, PETRI_TRANSITIONS=162} [2024-12-02 11:59:23,221 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 11 predicate places. [2024-12-02 11:59:23,221 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 162 transitions, 487 flow [2024-12-02 11:59:23,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-12-02 11:59:23,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:23,222 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:23,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:59:23,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1407866263, now seen corresponding path program 1 times [2024-12-02 11:59:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576164558] [2024-12-02 11:59:23,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 11:59:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:23,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576164558] [2024-12-02 11:59:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576164558] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:23,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:59:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009266099] [2024-12-02 11:59:23,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:23,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:59:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:23,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:59:23,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:59:23,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2024-12-02 11:59:23,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 162 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 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-12-02 11:59:23,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:23,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2024-12-02 11:59:23,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:27,010 INFO L124 PetriNetUnfolderBase]: 7011/27275 cut-off events. [2024-12-02 11:59:27,010 INFO L125 PetriNetUnfolderBase]: For 6404/14516 co-relation queries the response was YES. [2024-12-02 11:59:27,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44729 conditions, 27275 events. 7011/27275 cut-off events. For 6404/14516 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 351851 event pairs, 1470 based on Foata normal form. 31/23360 useless extension candidates. Maximal degree in co-relation 23973. Up to 3883 conditions per place. [2024-12-02 11:59:27,198 INFO L140 encePairwiseOnDemand]: 176/183 looper letters, 53 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2024-12-02 11:59:27,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 685 flow [2024-12-02 11:59:27,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 11:59:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 11:59:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1544 transitions. [2024-12-02 11:59:27,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437158469945355 [2024-12-02 11:59:27,202 INFO L175 Difference]: Start difference. First operand has 161 places, 162 transitions, 487 flow. Second operand 10 states and 1544 transitions. [2024-12-02 11:59:27,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 685 flow [2024-12-02 11:59:27,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:27,238 INFO L231 Difference]: Finished difference. Result has 171 places, 164 transitions, 505 flow [2024-12-02 11:59:27,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=505, PETRI_PLACES=171, PETRI_TRANSITIONS=164} [2024-12-02 11:59:27,239 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 21 predicate places. [2024-12-02 11:59:27,239 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 164 transitions, 505 flow [2024-12-02 11:59:27,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 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-12-02 11:59:27,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:27,240 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:27,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:59:27,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:27,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:27,241 INFO L85 PathProgramCache]: Analyzing trace with hash -72020030, now seen corresponding path program 1 times [2024-12-02 11:59:27,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:27,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743499490] [2024-12-02 11:59:27,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:27,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 11:59:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:27,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743499490] [2024-12-02 11:59:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743499490] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:27,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:59:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103181520] [2024-12-02 11:59:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:27,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:27,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:27,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:27,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2024-12-02 11:59:27,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 164 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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-12-02 11:59:27,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:27,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2024-12-02 11:59:27,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:28,331 INFO L124 PetriNetUnfolderBase]: 577/5856 cut-off events. [2024-12-02 11:59:28,331 INFO L125 PetriNetUnfolderBase]: For 1023/1269 co-relation queries the response was YES. [2024-12-02 11:59:28,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 5856 events. 577/5856 cut-off events. For 1023/1269 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 63736 event pairs, 252 based on Foata normal form. 164/5330 useless extension candidates. Maximal degree in co-relation 4006. Up to 528 conditions per place. [2024-12-02 11:59:28,357 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 16 selfloop transitions, 8 changer transitions 0/162 dead transitions. [2024-12-02 11:59:28,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 536 flow [2024-12-02 11:59:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-12-02 11:59:28,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9034608378870674 [2024-12-02 11:59:28,359 INFO L175 Difference]: Start difference. First operand has 171 places, 164 transitions, 505 flow. Second operand 3 states and 496 transitions. [2024-12-02 11:59:28,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 536 flow [2024-12-02 11:59:28,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 510 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-12-02 11:59:28,369 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 441 flow [2024-12-02 11:59:28,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2024-12-02 11:59:28,370 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 17 predicate places. [2024-12-02 11:59:28,370 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 441 flow [2024-12-02 11:59:28,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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-12-02 11:59:28,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:28,370 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:59:28,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash -113326936, now seen corresponding path program 1 times [2024-12-02 11:59:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768815904] [2024-12-02 11:59:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 11:59:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768815904] [2024-12-02 11:59:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768815904] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:28,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860997138] [2024-12-02 11:59:28,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:28,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:28,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:28,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 183 [2024-12-02 11:59:28,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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-12-02 11:59:28,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:28,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 183 [2024-12-02 11:59:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:29,538 INFO L124 PetriNetUnfolderBase]: 1009/6373 cut-off events. [2024-12-02 11:59:29,538 INFO L125 PetriNetUnfolderBase]: For 2996/2996 co-relation queries the response was YES. [2024-12-02 11:59:29,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10918 conditions, 6373 events. 1009/6373 cut-off events. For 2996/2996 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 70624 event pairs, 785 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 10619. Up to 1702 conditions per place. [2024-12-02 11:59:29,579 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 30 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2024-12-02 11:59:29,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 535 flow [2024-12-02 11:59:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-12-02 11:59:29,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2024-12-02 11:59:29,581 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 441 flow. Second operand 3 states and 471 transitions. [2024-12-02 11:59:29,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 535 flow [2024-12-02 11:59:29,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:59:29,587 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 467 flow [2024-12-02 11:59:29,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-12-02 11:59:29,588 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 20 predicate places. [2024-12-02 11:59:29,588 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 467 flow [2024-12-02 11:59:29,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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-12-02 11:59:29,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:29,589 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 11:59:29,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 11:59:29,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 11:59:29,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 443183247, now seen corresponding path program 1 times [2024-12-02 11:59:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024723079] [2024-12-02 11:59:29,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:59:29,616 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:59:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:59:29,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:59:29,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:59:29,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-12-02 11:59:29,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-12-02 11:59:29,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-12-02 11:59:29,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-12-02 11:59:29,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-12-02 11:59:29,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-12-02 11:59:29,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-12-02 11:59:29,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:59:29,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:59:29,648 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 11:59:29,648 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-02 11:59:29,701 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-12-02 11:59:29,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 219 transitions, 518 flow [2024-12-02 11:59:29,894 INFO L124 PetriNetUnfolderBase]: 90/1177 cut-off events. [2024-12-02 11:59:29,894 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-12-02 11:59:29,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1177 events. 90/1177 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5850 event pairs, 23 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1281. Up to 80 conditions per place. [2024-12-02 11:59:29,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 219 transitions, 518 flow [2024-12-02 11:59:29,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 164 transitions, 374 flow [2024-12-02 11:59:29,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:59:29,903 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;@5b3cb2c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:59:29,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-12-02 11:59:29,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:59:29,907 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-12-02 11:59:29,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:59:29,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:29,907 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] [2024-12-02 11:59:29,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 11:59:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:29,908 INFO L85 PathProgramCache]: Analyzing trace with hash -98503857, now seen corresponding path program 1 times [2024-12-02 11:59:29,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842954484] [2024-12-02 11:59:29,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842954484] [2024-12-02 11:59:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842954484] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:30,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:59:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908350367] [2024-12-02 11:59:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:30,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:30,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:30,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:30,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:30,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 219 [2024-12-02 11:59:30,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 164 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 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-12-02 11:59:30,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:30,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 219 [2024-12-02 11:59:30,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:38,772 INFO L124 PetriNetUnfolderBase]: 22557/56234 cut-off events. [2024-12-02 11:59:38,772 INFO L125 PetriNetUnfolderBase]: For 4405/4405 co-relation queries the response was YES. [2024-12-02 11:59:39,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89444 conditions, 56234 events. 22557/56234 cut-off events. For 4405/4405 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 671579 event pairs, 4473 based on Foata normal form. 1104/52847 useless extension candidates. Maximal degree in co-relation 21203. Up to 29151 conditions per place. [2024-12-02 11:59:39,355 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 69 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2024-12-02 11:59:39,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 580 flow [2024-12-02 11:59:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:59:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 11:59:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1049 transitions. [2024-12-02 11:59:39,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7983257229832572 [2024-12-02 11:59:39,357 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 374 flow. Second operand 6 states and 1049 transitions. [2024-12-02 11:59:39,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 580 flow [2024-12-02 11:59:39,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:39,368 INFO L231 Difference]: Finished difference. Result has 171 places, 161 transitions, 374 flow [2024-12-02 11:59:39,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=161} [2024-12-02 11:59:39,368 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2024-12-02 11:59:39,368 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 161 transitions, 374 flow [2024-12-02 11:59:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 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-12-02 11:59:39,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:39,369 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] [2024-12-02 11:59:39,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 11:59:39,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 11:59:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 936665208, now seen corresponding path program 1 times [2024-12-02 11:59:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17976602] [2024-12-02 11:59:39,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17976602] [2024-12-02 11:59:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17976602] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:39,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:39,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:59:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784412894] [2024-12-02 11:59:39,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:39,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:59:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:39,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:59:39,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:59:39,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 219 [2024-12-02 11:59:39,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 161 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 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-12-02 11:59:39,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:39,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 219 [2024-12-02 11:59:39,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:42,301 INFO L124 PetriNetUnfolderBase]: 6974/24532 cut-off events. [2024-12-02 11:59:42,302 INFO L125 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2024-12-02 11:59:42,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35624 conditions, 24532 events. 6974/24532 cut-off events. For 4016/4016 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 287606 event pairs, 3483 based on Foata normal form. 1/22342 useless extension candidates. Maximal degree in co-relation 19152. Up to 5916 conditions per place. [2024-12-02 11:59:42,490 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 36 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2024-12-02 11:59:42,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 480 flow [2024-12-02 11:59:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:59:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:59:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 753 transitions. [2024-12-02 11:59:42,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595890410958904 [2024-12-02 11:59:42,492 INFO L175 Difference]: Start difference. First operand has 171 places, 161 transitions, 374 flow. Second operand 4 states and 753 transitions. [2024-12-02 11:59:42,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 480 flow [2024-12-02 11:59:42,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 11:59:42,499 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 380 flow [2024-12-02 11:59:42,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2024-12-02 11:59:42,500 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2024-12-02 11:59:42,500 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 380 flow [2024-12-02 11:59:42,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 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-12-02 11:59:42,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:42,501 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] [2024-12-02 11:59:42,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 11:59:42,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 11:59:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 665830483, now seen corresponding path program 1 times [2024-12-02 11:59:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675935409] [2024-12-02 11:59:42,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:59:42,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:42,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675935409] [2024-12-02 11:59:42,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675935409] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:42,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:42,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:59:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266904698] [2024-12-02 11:59:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:42,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:59:42,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:42,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:59:42,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:59:42,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2024-12-02 11:59:42,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-12-02 11:59:42,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:42,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2024-12-02 11:59:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:59:58,026 INFO L124 PetriNetUnfolderBase]: 48754/121632 cut-off events. [2024-12-02 11:59:58,026 INFO L125 PetriNetUnfolderBase]: For 18880/18880 co-relation queries the response was YES. [2024-12-02 11:59:58,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192937 conditions, 121632 events. 48754/121632 cut-off events. For 18880/18880 co-relation queries the response was YES. Maximal size of possible extension queue 3510. Compared 1635189 event pairs, 34341 based on Foata normal form. 0/109045 useless extension candidates. Maximal degree in co-relation 191895. Up to 54063 conditions per place. [2024-12-02 11:59:59,125 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 45 selfloop transitions, 8 changer transitions 0/185 dead transitions. [2024-12-02 11:59:59,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 185 transitions, 564 flow [2024-12-02 11:59:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:59:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:59:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2024-12-02 11:59:59,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867579908675799 [2024-12-02 11:59:59,128 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 380 flow. Second operand 3 states and 570 transitions. [2024-12-02 11:59:59,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 185 transitions, 564 flow [2024-12-02 11:59:59,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:59:59,380 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 436 flow [2024-12-02 11:59:59,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2024-12-02 11:59:59,380 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 3 predicate places. [2024-12-02 11:59:59,380 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 436 flow [2024-12-02 11:59:59,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-12-02 11:59:59,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:59:59,381 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] [2024-12-02 11:59:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 11:59:59,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 11:59:59,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:59:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash 344064220, now seen corresponding path program 1 times [2024-12-02 11:59:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:59:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457255409] [2024-12-02 11:59:59,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:59:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:59:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:59:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:59:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:59:59,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457255409] [2024-12-02 11:59:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457255409] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:59:59,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:59:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:59:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117534673] [2024-12-02 11:59:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:59:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:59:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:59:59,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:59:59,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:59:59,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2024-12-02 11:59:59,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 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-12-02 11:59:59,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:59:59,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2024-12-02 11:59:59,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:12,117 INFO L124 PetriNetUnfolderBase]: 29825/96238 cut-off events. [2024-12-02 12:00:12,117 INFO L125 PetriNetUnfolderBase]: For 11734/12702 co-relation queries the response was YES. [2024-12-02 12:00:12,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148020 conditions, 96238 events. 29825/96238 cut-off events. For 11734/12702 co-relation queries the response was YES. Maximal size of possible extension queue 2361. Compared 1374134 event pairs, 11917 based on Foata normal form. 3/81962 useless extension candidates. Maximal degree in co-relation 38336. Up to 18035 conditions per place. [2024-12-02 12:00:12,957 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 47 selfloop transitions, 7 changer transitions 0/193 dead transitions. [2024-12-02 12:00:12,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 193 transitions, 594 flow [2024-12-02 12:00:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:00:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 12:00:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1287 transitions. [2024-12-02 12:00:12,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395303326810176 [2024-12-02 12:00:12,959 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 436 flow. Second operand 7 states and 1287 transitions. [2024-12-02 12:00:12,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 193 transitions, 594 flow [2024-12-02 12:00:13,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 193 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:00:13,089 INFO L231 Difference]: Finished difference. Result has 179 places, 172 transitions, 456 flow [2024-12-02 12:00:13,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=456, PETRI_PLACES=179, PETRI_TRANSITIONS=172} [2024-12-02 12:00:13,090 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 10 predicate places. [2024-12-02 12:00:13,090 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 172 transitions, 456 flow [2024-12-02 12:00:13,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 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-12-02 12:00:13,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:13,090 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:00:13,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 12:00:13,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1304183394, now seen corresponding path program 1 times [2024-12-02 12:00:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238159567] [2024-12-02 12:00:13,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:00:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238159567] [2024-12-02 12:00:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238159567] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:13,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:00:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144489217] [2024-12-02 12:00:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:13,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:00:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:13,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:00:13,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:00:13,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2024-12-02 12:00:13,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 172 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-12-02 12:00:13,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:13,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2024-12-02 12:00:13,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:20,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 197#$Ultimate##0true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 225#true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:20,572 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 225#true, 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:20,572 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-02 12:00:20,572 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-12-02 12:00:23,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 225#true, 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 176#L685-6true, 82#L685-5true, 222#true, 261#true]) [2024-12-02 12:00:23,184 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-12-02 12:00:23,184 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-12-02 12:00:23,185 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-12-02 12:00:23,185 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-12-02 12:00:23,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 225#true, 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:23,185 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-12-02 12:00:23,185 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-12-02 12:00:23,185 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-12-02 12:00:23,185 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 9#$Ultimate##0true, Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 197#$Ultimate##0true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:28,083 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 9#$Ultimate##0true, Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:28,083 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-12-02 12:00:28,083 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 197#$Ultimate##0true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 61#L684-3true, 226#true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:28,864 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 112#L684-3true, 227#true, 61#L684-3true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:28,864 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-12-02 12:00:28,864 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-12-02 12:00:31,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 9#$Ultimate##0true, Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 82#L685-5true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:31,214 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-12-02 12:00:31,214 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-12-02 12:00:31,214 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-12-02 12:00:31,214 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-12-02 12:00:31,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 61#L684-3true, 226#true, 82#L685-5true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:31,904 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-12-02 12:00:31,904 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-12-02 12:00:31,904 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-12-02 12:00:31,904 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-12-02 12:00:32,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 110#L685-5true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 82#L685-5true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:32,701 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-12-02 12:00:32,701 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-02 12:00:32,701 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-02 12:00:32,701 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-12-02 12:00:32,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 110#L685-5true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 45#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 226#true, 222#true, 261#true]) [2024-12-02 12:00:32,703 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-12-02 12:00:32,703 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-12-02 12:00:32,703 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-12-02 12:00:32,704 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-12-02 12:00:32,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 110#L685-5true, 224#true, 117#L685-5true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true]) [2024-12-02 12:00:32,704 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-12-02 12:00:32,704 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-12-02 12:00:32,704 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-12-02 12:00:32,704 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-12-02 12:00:32,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 9#$Ultimate##0true, Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:32,719 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-12-02 12:00:32,719 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-12-02 12:00:32,719 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-12-02 12:00:32,719 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-12-02 12:00:32,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 110#L685-5true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true]) [2024-12-02 12:00:32,986 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-12-02 12:00:32,986 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-12-02 12:00:32,986 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-12-02 12:00:32,986 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 45#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 226#true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:33,297 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 117#L685-5true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:33,297 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-12-02 12:00:33,297 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-12-02 12:00:33,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 61#L684-3true, 176#L685-6true, 226#true, 222#true, 261#true]) [2024-12-02 12:00:33,312 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:33,312 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:33,312 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:33,312 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:33,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 88#$Ultimate##0true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 82#L685-5true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:33,319 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-12-02 12:00:33,319 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-12-02 12:00:33,319 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-12-02 12:00:33,319 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-12-02 12:00:33,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:33,599 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:33,599 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:33,599 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:33,599 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 176#L685-6true, 226#true, 82#L685-5true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:34,117 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-12-02 12:00:34,117 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-02 12:00:34,117 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-02 12:00:34,117 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-12-02 12:00:34,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 110#L685-5true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 176#L685-6true, 222#true, 261#true]) [2024-12-02 12:00:34,118 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-12-02 12:00:34,118 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-02 12:00:34,118 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-12-02 12:00:34,118 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-02 12:00:34,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][153], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, 61#L684-3true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true]) [2024-12-02 12:00:34,122 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, 61#L684-3true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 45#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 226#true, 222#true, 261#true]) [2024-12-02 12:00:34,122 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, 117#L685-5true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 61#L684-3true, 226#true, 222#true, 261#true]) [2024-12-02 12:00:34,122 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-12-02 12:00:34,122 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-12-02 12:00:34,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 209#L684-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 82#L685-5true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:34,132 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-12-02 12:00:34,133 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-12-02 12:00:34,133 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-12-02 12:00:34,133 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-12-02 12:00:34,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 63#L686true, 197#$Ultimate##0true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:34,353 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,353 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,353 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,353 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, 61#L684-3true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true]) [2024-12-02 12:00:34,372 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,372 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,372 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-02 12:00:34,372 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-12-02 12:00:34,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 20#L686-3true, 224#true, 197#$Ultimate##0true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:34,597 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-12-02 12:00:34,597 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-02 12:00:34,597 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-02 12:00:34,597 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-12-02 12:00:34,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 88#$Ultimate##0true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:34,650 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-12-02 12:00:34,650 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-02 12:00:34,650 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-12-02 12:00:34,650 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-02 12:00:34,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 63#L686true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:34,863 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, 63#L686true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 61#L684-3true, 226#true, 222#true, 261#true]) [2024-12-02 12:00:34,863 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-02 12:00:34,863 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-12-02 12:00:35,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 20#L686-3true, 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L684-3true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:35,082 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-12-02 12:00:35,082 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-02 12:00:35,082 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-12-02 12:00:35,082 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-02 12:00:35,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 20#L686-3true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 61#L684-3true, 226#true, 222#true, 261#true]) [2024-12-02 12:00:35,083 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-12-02 12:00:35,083 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-02 12:00:35,083 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-12-02 12:00:35,083 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-02 12:00:35,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, 117#L685-5true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:35,109 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-12-02 12:00:35,109 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-02 12:00:35,109 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2024-12-02 12:00:35,109 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-02 12:00:35,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][164], [248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 176#L685-6true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:35,117 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2024-12-02 12:00:35,117 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:35,117 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-12-02 12:00:35,117 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:35,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, 209#L684-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:35,125 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-12-02 12:00:35,126 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-02 12:00:35,126 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-12-02 12:00:35,126 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-02 12:00:35,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:35,300 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2024-12-02 12:00:35,300 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:35,300 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:35,300 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-12-02 12:00:35,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 45#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:35,306 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2024-12-02 12:00:35,306 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:35,306 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-12-02 12:00:35,306 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:35,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 54#L685-4true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 82#L685-5true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:35,317 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2024-12-02 12:00:35,317 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-12-02 12:00:35,317 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-12-02 12:00:35,317 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-12-02 12:00:35,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, 63#L686true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:35,962 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2024-12-02 12:00:35,962 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-12-02 12:00:35,962 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-12-02 12:00:35,962 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-12-02 12:00:35,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][153], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 82#L685-5true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:35,974 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-12-02 12:00:35,974 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-02 12:00:35,974 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-02 12:00:35,974 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-12-02 12:00:36,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 20#L686-3true, Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 261#true, 55#L686-3true]) [2024-12-02 12:00:36,169 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2024-12-02 12:00:36,169 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-12-02 12:00:36,169 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-02 12:00:36,169 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-02 12:00:36,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][115], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, 54#L685-4true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:36,393 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2024-12-02 12:00:36,393 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-12-02 12:00:36,393 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-02 12:00:36,393 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-02 12:00:36,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][153], [111#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 255#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0)), Black: 257#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 172#L699-1true, 224#true, 157#L686-3true, Black: 239#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 51#L685-6true, 227#true, Black: 243#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 226#true, 222#true, 55#L686-3true, 261#true]) [2024-12-02 12:00:36,708 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2024-12-02 12:00:36,708 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:36,708 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-12-02 12:00:36,708 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-02 12:00:38,331 INFO L124 PetriNetUnfolderBase]: 86760/230468 cut-off events. [2024-12-02 12:00:38,331 INFO L125 PetriNetUnfolderBase]: For 62265/67069 co-relation queries the response was YES. [2024-12-02 12:00:39,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399744 conditions, 230468 events. 86760/230468 cut-off events. For 62265/67069 co-relation queries the response was YES. Maximal size of possible extension queue 6459. Compared 3424541 event pairs, 48742 based on Foata normal form. 116/203031 useless extension candidates. Maximal degree in co-relation 393869. Up to 92664 conditions per place. [2024-12-02 12:00:40,559 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 48 selfloop transitions, 13 changer transitions 0/198 dead transitions. [2024-12-02 12:00:40,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 198 transitions, 675 flow [2024-12-02 12:00:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:00:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:00:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2024-12-02 12:00:40,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8660578386605784 [2024-12-02 12:00:40,560 INFO L175 Difference]: Start difference. First operand has 179 places, 172 transitions, 456 flow. Second operand 3 states and 569 transitions. [2024-12-02 12:00:40,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 198 transitions, 675 flow [2024-12-02 12:00:41,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 198 transitions, 665 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-12-02 12:00:41,450 INFO L231 Difference]: Finished difference. Result has 180 places, 183 transitions, 562 flow [2024-12-02 12:00:41,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=180, PETRI_TRANSITIONS=183} [2024-12-02 12:00:41,451 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 11 predicate places. [2024-12-02 12:00:41,451 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 183 transitions, 562 flow [2024-12-02 12:00:41,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-12-02 12:00:41,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:41,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:00:41,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 12:00:41,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2124294802, now seen corresponding path program 1 times [2024-12-02 12:00:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694583702] [2024-12-02 12:00:41,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:00:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694583702] [2024-12-02 12:00:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694583702] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 12:00:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909467456] [2024-12-02 12:00:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:00:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:41,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:00:41,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:00:41,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 219 [2024-12-02 12:00:41,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 183 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-12-02 12:00:41,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:41,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 219 [2024-12-02 12:00:41,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:43,531 INFO L124 PetriNetUnfolderBase]: 2588/20642 cut-off events. [2024-12-02 12:00:43,531 INFO L125 PetriNetUnfolderBase]: For 5063/5993 co-relation queries the response was YES. [2024-12-02 12:00:43,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29581 conditions, 20642 events. 2588/20642 cut-off events. For 5063/5993 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 276501 event pairs, 1161 based on Foata normal form. 908/19191 useless extension candidates. Maximal degree in co-relation 10966. Up to 1926 conditions per place. [2024-12-02 12:00:43,608 INFO L140 encePairwiseOnDemand]: 209/219 looper letters, 20 selfloop transitions, 10 changer transitions 0/180 dead transitions. [2024-12-02 12:00:43,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 585 flow [2024-12-02 12:00:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:00:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:00:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2024-12-02 12:00:43,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.893455098934551 [2024-12-02 12:00:43,610 INFO L175 Difference]: Start difference. First operand has 180 places, 183 transitions, 562 flow. Second operand 3 states and 587 transitions. [2024-12-02 12:00:43,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 585 flow [2024-12-02 12:00:43,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 180 transitions, 573 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-12-02 12:00:43,621 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 480 flow [2024-12-02 12:00:43,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=180, PETRI_TRANSITIONS=171} [2024-12-02 12:00:43,622 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 11 predicate places. [2024-12-02 12:00:43,622 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 480 flow [2024-12-02 12:00:43,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-12-02 12:00:43,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:43,622 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:00:43,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 12:00:43,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:43,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1112971031, now seen corresponding path program 1 times [2024-12-02 12:00:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895048645] [2024-12-02 12:00:43,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 12:00:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895048645] [2024-12-02 12:00:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895048645] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 12:00:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191556272] [2024-12-02 12:00:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:43,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:00:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:43,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:00:43,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:00:43,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2024-12-02 12:00:43,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 480 flow. Second operand has 8 states, 8 states have (on average 177.625) internal successors, (1421), 8 states have internal predecessors, (1421), 0 states have call successors, (0), 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-12-02 12:00:43,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:43,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2024-12-02 12:00:43,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:46,115 INFO L124 PetriNetUnfolderBase]: 3443/23892 cut-off events. [2024-12-02 12:00:46,115 INFO L125 PetriNetUnfolderBase]: For 6636/6988 co-relation queries the response was YES. [2024-12-02 12:00:46,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37318 conditions, 23892 events. 3443/23892 cut-off events. For 6636/6988 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 321068 event pairs, 1336 based on Foata normal form. 8/21054 useless extension candidates. Maximal degree in co-relation 10746. Up to 3001 conditions per place. [2024-12-02 12:00:46,228 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 61 selfloop transitions, 10 changer transitions 0/209 dead transitions. [2024-12-02 12:00:46,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 209 transitions, 776 flow [2024-12-02 12:00:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:00:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 12:00:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1832 transitions. [2024-12-02 12:00:46,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8365296803652968 [2024-12-02 12:00:46,231 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 480 flow. Second operand 10 states and 1832 transitions. [2024-12-02 12:00:46,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 209 transitions, 776 flow [2024-12-02 12:00:46,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 209 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 12:00:46,236 INFO L231 Difference]: Finished difference. Result has 191 places, 174 transitions, 518 flow [2024-12-02 12:00:46,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=518, PETRI_PLACES=191, PETRI_TRANSITIONS=174} [2024-12-02 12:00:46,236 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 22 predicate places. [2024-12-02 12:00:46,236 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 174 transitions, 518 flow [2024-12-02 12:00:46,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 177.625) internal successors, (1421), 8 states have internal predecessors, (1421), 0 states have call successors, (0), 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-12-02 12:00:46,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:46,237 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:00:46,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 12:00:46,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:46,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1785560398, now seen corresponding path program 1 times [2024-12-02 12:00:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121945322] [2024-12-02 12:00:46,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:00:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121945322] [2024-12-02 12:00:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121945322] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:00:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367083094] [2024-12-02 12:00:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:46,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:00:46,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:46,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:00:46,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:00:46,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2024-12-02 12:00:46,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 174 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:00:46,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:46,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2024-12-02 12:00:46,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:48,425 INFO L124 PetriNetUnfolderBase]: 4282/21862 cut-off events. [2024-12-02 12:00:48,425 INFO L125 PetriNetUnfolderBase]: For 11856/11856 co-relation queries the response was YES. [2024-12-02 12:00:48,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38878 conditions, 21862 events. 4282/21862 cut-off events. For 11856/11856 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 297288 event pairs, 3027 based on Foata normal form. 0/19683 useless extension candidates. Maximal degree in co-relation 36866. Up to 6668 conditions per place. [2024-12-02 12:00:48,537 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 37 selfloop transitions, 4 changer transitions 0/183 dead transitions. [2024-12-02 12:00:48,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 183 transitions, 642 flow [2024-12-02 12:00:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:00:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:00:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2024-12-02 12:00:48,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462709284627092 [2024-12-02 12:00:48,538 INFO L175 Difference]: Start difference. First operand has 191 places, 174 transitions, 518 flow. Second operand 3 states and 556 transitions. [2024-12-02 12:00:48,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 183 transitions, 642 flow [2024-12-02 12:00:48,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 183 transitions, 620 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-12-02 12:00:48,608 INFO L231 Difference]: Finished difference. Result has 189 places, 177 transitions, 530 flow [2024-12-02 12:00:48,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=189, PETRI_TRANSITIONS=177} [2024-12-02 12:00:48,608 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 20 predicate places. [2024-12-02 12:00:48,608 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 177 transitions, 530 flow [2024-12-02 12:00:48,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 12:00:48,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:48,609 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-12-02 12:00:48,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 12:00:48,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2085502885, now seen corresponding path program 1 times [2024-12-02 12:00:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623101857] [2024-12-02 12:00:48,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 12:00:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623101857] [2024-12-02 12:00:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623101857] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:00:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181187410] [2024-12-02 12:00:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:00:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:48,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:00:48,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:00:48,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 219 [2024-12-02 12:00:48,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 177 transitions, 530 flow. Second operand has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 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-12-02 12:00:48,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:48,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 219 [2024-12-02 12:00:48,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:51,553 INFO L124 PetriNetUnfolderBase]: 3611/24955 cut-off events. [2024-12-02 12:00:51,553 INFO L125 PetriNetUnfolderBase]: For 8400/8863 co-relation queries the response was YES. [2024-12-02 12:00:51,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39867 conditions, 24955 events. 3611/24955 cut-off events. For 8400/8863 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 336244 event pairs, 1184 based on Foata normal form. 20/22146 useless extension candidates. Maximal degree in co-relation 13863. Up to 2577 conditions per place. [2024-12-02 12:00:51,680 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 83 selfloop transitions, 14 changer transitions 0/237 dead transitions. [2024-12-02 12:00:51,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 237 transitions, 906 flow [2024-12-02 12:00:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:00:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 12:00:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2373 transitions. [2024-12-02 12:00:51,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8335089567966281 [2024-12-02 12:00:51,684 INFO L175 Difference]: Start difference. First operand has 189 places, 177 transitions, 530 flow. Second operand 13 states and 2373 transitions. [2024-12-02 12:00:51,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 237 transitions, 906 flow [2024-12-02 12:00:51,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 237 transitions, 894 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-12-02 12:00:51,699 INFO L231 Difference]: Finished difference. Result has 203 places, 180 transitions, 580 flow [2024-12-02 12:00:51,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=580, PETRI_PLACES=203, PETRI_TRANSITIONS=180} [2024-12-02 12:00:51,699 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 34 predicate places. [2024-12-02 12:00:51,699 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 180 transitions, 580 flow [2024-12-02 12:00:51,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 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-12-02 12:00:51,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:51,700 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 12:00:51,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 12:00:51,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:51,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2144551043, now seen corresponding path program 1 times [2024-12-02 12:00:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:51,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718472847] [2024-12-02 12:00:51,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:00:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718472847] [2024-12-02 12:00:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718472847] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:51,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:00:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428443945] [2024-12-02 12:00:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:51,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:00:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:51,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:00:51,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:00:51,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2024-12-02 12:00:51,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 180 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-12-02 12:00:51,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:51,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2024-12-02 12:00:51,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:54,345 INFO L124 PetriNetUnfolderBase]: 4087/23106 cut-off events. [2024-12-02 12:00:54,345 INFO L125 PetriNetUnfolderBase]: For 15508/15508 co-relation queries the response was YES. [2024-12-02 12:00:54,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42460 conditions, 23106 events. 4087/23106 cut-off events. For 15508/15508 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 319947 event pairs, 3207 based on Foata normal form. 0/20740 useless extension candidates. Maximal degree in co-relation 41642. Up to 6422 conditions per place. [2024-12-02 12:00:54,449 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 37 selfloop transitions, 4 changer transitions 0/188 dead transitions. [2024-12-02 12:00:54,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 188 transitions, 695 flow [2024-12-02 12:00:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:00:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:00:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2024-12-02 12:00:54,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2024-12-02 12:00:54,450 INFO L175 Difference]: Start difference. First operand has 203 places, 180 transitions, 580 flow. Second operand 3 states and 555 transitions. [2024-12-02 12:00:54,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 188 transitions, 695 flow [2024-12-02 12:00:54,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 188 transitions, 665 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-12-02 12:00:54,564 INFO L231 Difference]: Finished difference. Result has 199 places, 183 transitions, 586 flow [2024-12-02 12:00:54,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=199, PETRI_TRANSITIONS=183} [2024-12-02 12:00:54,565 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 30 predicate places. [2024-12-02 12:00:54,565 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 183 transitions, 586 flow [2024-12-02 12:00:54,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-12-02 12:00:54,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:54,565 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:00:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 12:00:54,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash 778617652, now seen corresponding path program 1 times [2024-12-02 12:00:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148072355] [2024-12-02 12:00:54,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 12:00:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148072355] [2024-12-02 12:00:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148072355] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:00:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379610512] [2024-12-02 12:00:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:00:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:54,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:00:54,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:00:54,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 219 [2024-12-02 12:00:54,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 183 transitions, 586 flow. Second operand has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 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-12-02 12:00:54,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:54,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 219 [2024-12-02 12:00:54,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:00:57,809 INFO L124 PetriNetUnfolderBase]: 3709/25891 cut-off events. [2024-12-02 12:00:57,809 INFO L125 PetriNetUnfolderBase]: For 12538/13098 co-relation queries the response was YES. [2024-12-02 12:00:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44023 conditions, 25891 events. 3709/25891 cut-off events. For 12538/13098 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 355516 event pairs, 1136 based on Foata normal form. 48/23016 useless extension candidates. Maximal degree in co-relation 15472. Up to 2264 conditions per place. [2024-12-02 12:00:57,942 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 104 selfloop transitions, 16 changer transitions 0/262 dead transitions. [2024-12-02 12:00:57,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 262 transitions, 1060 flow [2024-12-02 12:00:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 12:00:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-12-02 12:00:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2921 transitions. [2024-12-02 12:00:57,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8336187214611872 [2024-12-02 12:00:57,945 INFO L175 Difference]: Start difference. First operand has 199 places, 183 transitions, 586 flow. Second operand 16 states and 2921 transitions. [2024-12-02 12:00:57,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 262 transitions, 1060 flow [2024-12-02 12:00:57,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 262 transitions, 1038 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-12-02 12:00:57,981 INFO L231 Difference]: Finished difference. Result has 208 places, 181 transitions, 584 flow [2024-12-02 12:00:57,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=584, PETRI_PLACES=208, PETRI_TRANSITIONS=181} [2024-12-02 12:00:57,981 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 39 predicate places. [2024-12-02 12:00:57,982 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 181 transitions, 584 flow [2024-12-02 12:00:57,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 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-12-02 12:00:57,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:00:57,982 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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-12-02 12:00:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 12:00:57,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:00:57,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:00:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 473934262, now seen corresponding path program 1 times [2024-12-02 12:00:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:00:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131075120] [2024-12-02 12:00:57,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:00:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:00:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:00:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:00:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:00:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131075120] [2024-12-02 12:00:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131075120] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:00:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:00:58,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:00:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109320155] [2024-12-02 12:00:58,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:00:58,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:00:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:00:58,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:00:58,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:00:58,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 219 [2024-12-02 12:00:58,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 181 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 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-12-02 12:00:58,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:00:58,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 219 [2024-12-02 12:00:58,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:02,150 INFO L124 PetriNetUnfolderBase]: 8264/34391 cut-off events. [2024-12-02 12:01:02,150 INFO L125 PetriNetUnfolderBase]: For 14147/15153 co-relation queries the response was YES. [2024-12-02 12:01:02,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63350 conditions, 34391 events. 8264/34391 cut-off events. For 14147/15153 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 451938 event pairs, 6585 based on Foata normal form. 0/29874 useless extension candidates. Maximal degree in co-relation 61068. Up to 12933 conditions per place. [2024-12-02 12:01:02,336 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 68 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2024-12-02 12:01:02,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 214 transitions, 830 flow [2024-12-02 12:01:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:01:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:01:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2024-12-02 12:01:02,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097412480974124 [2024-12-02 12:01:02,337 INFO L175 Difference]: Start difference. First operand has 208 places, 181 transitions, 584 flow. Second operand 6 states and 1064 transitions. [2024-12-02 12:01:02,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 214 transitions, 830 flow [2024-12-02 12:01:02,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 214 transitions, 762 flow, removed 6 selfloop flow, removed 21 redundant places. [2024-12-02 12:01:02,666 INFO L231 Difference]: Finished difference. Result has 191 places, 180 transitions, 524 flow [2024-12-02 12:01:02,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=191, PETRI_TRANSITIONS=180} [2024-12-02 12:01:02,666 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 22 predicate places. [2024-12-02 12:01:02,666 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 180 transitions, 524 flow [2024-12-02 12:01:02,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 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-12-02 12:01:02,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:02,667 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 12:01:02,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:02,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash -803601228, now seen corresponding path program 1 times [2024-12-02 12:01:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016033545] [2024-12-02 12:01:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 12:01:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016033545] [2024-12-02 12:01:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016033545] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:02,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:01:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080474539] [2024-12-02 12:01:02,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:01:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:02,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:01:02,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:01:02,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 219 [2024-12-02 12:01:02,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 180 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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-12-02 12:01:02,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:02,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 219 [2024-12-02 12:01:02,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:05,463 INFO L124 PetriNetUnfolderBase]: 5136/26950 cut-off events. [2024-12-02 12:01:05,463 INFO L125 PetriNetUnfolderBase]: For 10227/11137 co-relation queries the response was YES. [2024-12-02 12:01:05,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45317 conditions, 26950 events. 5136/26950 cut-off events. For 10227/11137 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 365394 event pairs, 3190 based on Foata normal form. 112/24387 useless extension candidates. Maximal degree in co-relation 44672. Up to 5257 conditions per place. [2024-12-02 12:01:05,609 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 48 selfloop transitions, 4 changer transitions 1/206 dead transitions. [2024-12-02 12:01:05,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 206 transitions, 713 flow [2024-12-02 12:01:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:01:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 12:01:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 766 transitions. [2024-12-02 12:01:05,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744292237442922 [2024-12-02 12:01:05,610 INFO L175 Difference]: Start difference. First operand has 191 places, 180 transitions, 524 flow. Second operand 4 states and 766 transitions. [2024-12-02 12:01:05,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 206 transitions, 713 flow [2024-12-02 12:01:05,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 206 transitions, 703 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 12:01:05,615 INFO L231 Difference]: Finished difference. Result has 190 places, 181 transitions, 530 flow [2024-12-02 12:01:05,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=530, PETRI_PLACES=190, PETRI_TRANSITIONS=181} [2024-12-02 12:01:05,616 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 21 predicate places. [2024-12-02 12:01:05,616 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 181 transitions, 530 flow [2024-12-02 12:01:05,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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-12-02 12:01:05,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:05,616 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:05,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 12:01:05,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1522404277, now seen corresponding path program 1 times [2024-12-02 12:01:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332484638] [2024-12-02 12:01:05,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 12:01:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332484638] [2024-12-02 12:01:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332484638] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:05,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:05,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:01:05,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619216569] [2024-12-02 12:01:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:05,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:01:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:05,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:01:05,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:01:05,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2024-12-02 12:01:05,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 181 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-12-02 12:01:05,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:05,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2024-12-02 12:01:05,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:07,925 INFO L124 PetriNetUnfolderBase]: 3809/21738 cut-off events. [2024-12-02 12:01:07,926 INFO L125 PetriNetUnfolderBase]: For 18123/18123 co-relation queries the response was YES. [2024-12-02 12:01:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40916 conditions, 21738 events. 3809/21738 cut-off events. For 18123/18123 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 300000 event pairs, 2943 based on Foata normal form. 0/19662 useless extension candidates. Maximal degree in co-relation 40153. Up to 5912 conditions per place. [2024-12-02 12:01:08,057 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 37 selfloop transitions, 4 changer transitions 0/188 dead transitions. [2024-12-02 12:01:08,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 644 flow [2024-12-02 12:01:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:01:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:01:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2024-12-02 12:01:08,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8432267884322678 [2024-12-02 12:01:08,059 INFO L175 Difference]: Start difference. First operand has 190 places, 181 transitions, 530 flow. Second operand 3 states and 554 transitions. [2024-12-02 12:01:08,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 644 flow [2024-12-02 12:01:08,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 188 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:01:08,091 INFO L231 Difference]: Finished difference. Result has 192 places, 184 transitions, 562 flow [2024-12-02 12:01:08,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2024-12-02 12:01:08,092 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 23 predicate places. [2024-12-02 12:01:08,092 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 562 flow [2024-12-02 12:01:08,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-12-02 12:01:08,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:08,092 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:08,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 12:01:08,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:08,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1078046204, now seen corresponding path program 1 times [2024-12-02 12:01:08,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:08,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796070662] [2024-12-02 12:01:08,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:08,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 12:01:08,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796070662] [2024-12-02 12:01:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796070662] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:01:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108505153] [2024-12-02 12:01:08,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:08,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:01:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:08,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:01:08,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:01:08,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 219 [2024-12-02 12:01:08,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 167.5) internal successors, (1005), 6 states have internal predecessors, (1005), 0 states have call successors, (0), 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-12-02 12:01:08,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:08,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 219 [2024-12-02 12:01:08,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:12,447 INFO L124 PetriNetUnfolderBase]: 9849/38236 cut-off events. [2024-12-02 12:01:12,448 INFO L125 PetriNetUnfolderBase]: For 16795/17835 co-relation queries the response was YES. [2024-12-02 12:01:12,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73860 conditions, 38236 events. 9849/38236 cut-off events. For 16795/17835 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 504067 event pairs, 4499 based on Foata normal form. 0/35217 useless extension candidates. Maximal degree in co-relation 71601. Up to 7835 conditions per place. [2024-12-02 12:01:12,659 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 75 selfloop transitions, 6 changer transitions 0/223 dead transitions. [2024-12-02 12:01:12,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 223 transitions, 842 flow [2024-12-02 12:01:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:01:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 12:01:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1065 transitions. [2024-12-02 12:01:12,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105022831050228 [2024-12-02 12:01:12,660 INFO L175 Difference]: Start difference. First operand has 192 places, 184 transitions, 562 flow. Second operand 6 states and 1065 transitions. [2024-12-02 12:01:12,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 223 transitions, 842 flow [2024-12-02 12:01:12,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 223 transitions, 826 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-12-02 12:01:12,708 INFO L231 Difference]: Finished difference. Result has 194 places, 183 transitions, 556 flow [2024-12-02 12:01:12,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=556, PETRI_PLACES=194, PETRI_TRANSITIONS=183} [2024-12-02 12:01:12,709 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 25 predicate places. [2024-12-02 12:01:12,709 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 183 transitions, 556 flow [2024-12-02 12:01:12,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.5) internal successors, (1005), 6 states have internal predecessors, (1005), 0 states have call successors, (0), 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-12-02 12:01:12,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:12,709 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:12,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 12:01:12,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:12,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1996964706, now seen corresponding path program 1 times [2024-12-02 12:01:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826992471] [2024-12-02 12:01:12,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:12,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-02 12:01:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826992471] [2024-12-02 12:01:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826992471] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:01:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644254107] [2024-12-02 12:01:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:12,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 12:01:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:12,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 12:01:12,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 12:01:12,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 219 [2024-12-02 12:01:12,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 183 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-12-02 12:01:12,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:12,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 219 [2024-12-02 12:01:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:16,544 INFO L124 PetriNetUnfolderBase]: 6115/36181 cut-off events. [2024-12-02 12:01:16,544 INFO L125 PetriNetUnfolderBase]: For 25337/25337 co-relation queries the response was YES. [2024-12-02 12:01:16,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68001 conditions, 36181 events. 6115/36181 cut-off events. For 25337/25337 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 535214 event pairs, 2805 based on Foata normal form. 0/33736 useless extension candidates. Maximal degree in co-relation 67238. Up to 6857 conditions per place. [2024-12-02 12:01:16,746 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 37 selfloop transitions, 11 changer transitions 1/199 dead transitions. [2024-12-02 12:01:16,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 199 transitions, 722 flow [2024-12-02 12:01:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 12:01:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 12:01:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2024-12-02 12:01:16,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863013698630137 [2024-12-02 12:01:16,747 INFO L175 Difference]: Start difference. First operand has 194 places, 183 transitions, 556 flow. Second operand 3 states and 567 transitions. [2024-12-02 12:01:16,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 199 transitions, 722 flow [2024-12-02 12:01:16,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 199 transitions, 710 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 12:01:16,760 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 638 flow [2024-12-02 12:01:16,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2024-12-02 12:01:16,760 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 24 predicate places. [2024-12-02 12:01:16,760 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 638 flow [2024-12-02 12:01:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-12-02 12:01:16,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:16,761 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 12:01:16,761 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -49544278, now seen corresponding path program 1 times [2024-12-02 12:01:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032290093] [2024-12-02 12:01:16,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 12:01:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032290093] [2024-12-02 12:01:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032290093] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 12:01:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757979268] [2024-12-02 12:01:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:01:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:16,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:01:16,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:01:16,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2024-12-02 12:01:16,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 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-12-02 12:01:16,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:16,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2024-12-02 12:01:16,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:19,949 INFO L124 PetriNetUnfolderBase]: 5361/26384 cut-off events. [2024-12-02 12:01:19,950 INFO L125 PetriNetUnfolderBase]: For 20255/21299 co-relation queries the response was YES. [2024-12-02 12:01:20,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51093 conditions, 26384 events. 5361/26384 cut-off events. For 20255/21299 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 350812 event pairs, 1654 based on Foata normal form. 240/25902 useless extension candidates. Maximal degree in co-relation 50428. Up to 3974 conditions per place. [2024-12-02 12:01:20,071 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 77 selfloop transitions, 7 changer transitions 10/252 dead transitions. [2024-12-02 12:01:20,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 252 transitions, 1028 flow [2024-12-02 12:01:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:01:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 12:01:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1327 transitions. [2024-12-02 12:01:20,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656229615133725 [2024-12-02 12:01:20,072 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 638 flow. Second operand 7 states and 1327 transitions. [2024-12-02 12:01:20,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 252 transitions, 1028 flow [2024-12-02 12:01:20,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 252 transitions, 1006 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 12:01:20,136 INFO L231 Difference]: Finished difference. Result has 200 places, 191 transitions, 652 flow [2024-12-02 12:01:20,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=652, PETRI_PLACES=200, PETRI_TRANSITIONS=191} [2024-12-02 12:01:20,136 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 31 predicate places. [2024-12-02 12:01:20,136 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 191 transitions, 652 flow [2024-12-02 12:01:20,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 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-12-02 12:01:20,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:20,137 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:20,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 12:01:20,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:20,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1968961153, now seen corresponding path program 1 times [2024-12-02 12:01:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832513568] [2024-12-02 12:01:20,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 12:01:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832513568] [2024-12-02 12:01:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832513568] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:20,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:20,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 12:01:20,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326613839] [2024-12-02 12:01:20,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:20,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:01:20,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:20,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:01:20,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:01:20,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2024-12-02 12:01:20,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 191 transitions, 652 flow. Second operand has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 0 states have call successors, (0), 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-12-02 12:01:20,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:20,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2024-12-02 12:01:20,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:22,400 INFO L124 PetriNetUnfolderBase]: 3821/15980 cut-off events. [2024-12-02 12:01:22,400 INFO L125 PetriNetUnfolderBase]: For 9620/9944 co-relation queries the response was YES. [2024-12-02 12:01:22,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31972 conditions, 15980 events. 3821/15980 cut-off events. For 9620/9944 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 180462 event pairs, 558 based on Foata normal form. 200/15980 useless extension candidates. Maximal degree in co-relation 31303. Up to 1780 conditions per place. [2024-12-02 12:01:22,492 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 112 selfloop transitions, 10 changer transitions 10/290 dead transitions. [2024-12-02 12:01:22,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 290 transitions, 1237 flow [2024-12-02 12:01:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:01:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 12:01:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1893 transitions. [2024-12-02 12:01:22,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8643835616438356 [2024-12-02 12:01:22,494 INFO L175 Difference]: Start difference. First operand has 200 places, 191 transitions, 652 flow. Second operand 10 states and 1893 transitions. [2024-12-02 12:01:22,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 290 transitions, 1237 flow [2024-12-02 12:01:22,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 290 transitions, 1227 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-12-02 12:01:22,528 INFO L231 Difference]: Finished difference. Result has 209 places, 194 transitions, 690 flow [2024-12-02 12:01:22,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=690, PETRI_PLACES=209, PETRI_TRANSITIONS=194} [2024-12-02 12:01:22,529 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 40 predicate places. [2024-12-02 12:01:22,529 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 194 transitions, 690 flow [2024-12-02 12:01:22,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 0 states have call successors, (0), 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-12-02 12:01:22,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:22,530 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 12:01:22,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 12:01:22,530 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:22,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1357519311, now seen corresponding path program 1 times [2024-12-02 12:01:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312750363] [2024-12-02 12:01:22,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 12:01:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312750363] [2024-12-02 12:01:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312750363] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:01:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665236841] [2024-12-02 12:01:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:22,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:01:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:01:22,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:01:22,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 219 [2024-12-02 12:01:22,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 194 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 178.2) internal successors, (1782), 10 states have internal predecessors, (1782), 0 states have call successors, (0), 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-12-02 12:01:22,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:22,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 219 [2024-12-02 12:01:22,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:24,632 INFO L124 PetriNetUnfolderBase]: 4171/13510 cut-off events. [2024-12-02 12:01:24,632 INFO L125 PetriNetUnfolderBase]: For 8667/8703 co-relation queries the response was YES. [2024-12-02 12:01:24,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29398 conditions, 13510 events. 4171/13510 cut-off events. For 8667/8703 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 139786 event pairs, 188 based on Foata normal form. 80/13450 useless extension candidates. Maximal degree in co-relation 28726. Up to 1945 conditions per place. [2024-12-02 12:01:24,717 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 144 selfloop transitions, 13 changer transitions 21/325 dead transitions. [2024-12-02 12:01:24,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 325 transitions, 1439 flow [2024-12-02 12:01:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:01:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 12:01:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2444 transitions. [2024-12-02 12:01:24,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8584474885844748 [2024-12-02 12:01:24,719 INFO L175 Difference]: Start difference. First operand has 209 places, 194 transitions, 690 flow. Second operand 13 states and 2444 transitions. [2024-12-02 12:01:24,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 325 transitions, 1439 flow [2024-12-02 12:01:24,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 325 transitions, 1417 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-12-02 12:01:24,789 INFO L231 Difference]: Finished difference. Result has 219 places, 186 transitions, 684 flow [2024-12-02 12:01:24,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=684, PETRI_PLACES=219, PETRI_TRANSITIONS=186} [2024-12-02 12:01:24,789 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 50 predicate places. [2024-12-02 12:01:24,789 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 186 transitions, 684 flow [2024-12-02 12:01:24,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.2) internal successors, (1782), 10 states have internal predecessors, (1782), 0 states have call successors, (0), 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-12-02 12:01:24,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:24,790 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:24,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 12:01:24,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:24,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -931024606, now seen corresponding path program 1 times [2024-12-02 12:01:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402336941] [2024-12-02 12:01:24,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 12:01:25,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402336941] [2024-12-02 12:01:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402336941] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:01:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494720630] [2024-12-02 12:01:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:25,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:01:25,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:01:25,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:01:25,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 12:01:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:25,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 12:01:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:01:25,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 12:01:26,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 12:01:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 12:01:26,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:01:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 12:01:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494720630] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:01:26,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:01:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 28 [2024-12-02 12:01:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332476762] [2024-12-02 12:01:26,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:01:26,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 12:01:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:26,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 12:01:26,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2024-12-02 12:01:27,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 219 [2024-12-02 12:01:27,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 186 transitions, 684 flow. Second operand has 28 states, 28 states have (on average 171.67857142857142) internal successors, (4807), 28 states have internal predecessors, (4807), 0 states have call successors, (0), 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-12-02 12:01:27,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:27,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 219 [2024-12-02 12:01:27,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:30,010 INFO L124 PetriNetUnfolderBase]: 3718/14078 cut-off events. [2024-12-02 12:01:30,010 INFO L125 PetriNetUnfolderBase]: For 8171/8207 co-relation queries the response was YES. [2024-12-02 12:01:30,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30094 conditions, 14078 events. 3718/14078 cut-off events. For 8171/8207 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 148318 event pairs, 324 based on Foata normal form. 48/13963 useless extension candidates. Maximal degree in co-relation 27268. Up to 4003 conditions per place. [2024-12-02 12:01:30,115 INFO L140 encePairwiseOnDemand]: 205/219 looper letters, 126 selfloop transitions, 22 changer transitions 10/304 dead transitions. [2024-12-02 12:01:30,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 304 transitions, 1344 flow [2024-12-02 12:01:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 12:01:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-12-02 12:01:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3853 transitions. [2024-12-02 12:01:30,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7997094229970942 [2024-12-02 12:01:30,120 INFO L175 Difference]: Start difference. First operand has 219 places, 186 transitions, 684 flow. Second operand 22 states and 3853 transitions. [2024-12-02 12:01:30,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 304 transitions, 1344 flow [2024-12-02 12:01:30,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 304 transitions, 1310 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-12-02 12:01:30,205 INFO L231 Difference]: Finished difference. Result has 233 places, 197 transitions, 728 flow [2024-12-02 12:01:30,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=728, PETRI_PLACES=233, PETRI_TRANSITIONS=197} [2024-12-02 12:01:30,205 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 64 predicate places. [2024-12-02 12:01:30,205 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 197 transitions, 728 flow [2024-12-02 12:01:30,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 171.67857142857142) internal successors, (4807), 28 states have internal predecessors, (4807), 0 states have call successors, (0), 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-12-02 12:01:30,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:30,207 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:30,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 12:01:30,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 12:01:30,408 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:30,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1412733678, now seen corresponding path program 2 times [2024-12-02 12:01:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416897438] [2024-12-02 12:01:30,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:01:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:30,455 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:01:30,455 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:01:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 12:01:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416897438] [2024-12-02 12:01:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416897438] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:31,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:31,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:01:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891980769] [2024-12-02 12:01:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:31,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:01:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:31,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:01:31,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:01:31,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 219 [2024-12-02 12:01:31,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 197 transitions, 728 flow. Second operand has 12 states, 12 states have (on average 171.83333333333334) internal successors, (2062), 12 states have internal predecessors, (2062), 0 states have call successors, (0), 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-12-02 12:01:31,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:31,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 219 [2024-12-02 12:01:31,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:34,160 INFO L124 PetriNetUnfolderBase]: 3282/12750 cut-off events. [2024-12-02 12:01:34,161 INFO L125 PetriNetUnfolderBase]: For 8378/8414 co-relation queries the response was YES. [2024-12-02 12:01:34,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27592 conditions, 12750 events. 3282/12750 cut-off events. For 8378/8414 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 131250 event pairs, 408 based on Foata normal form. 48/12650 useless extension candidates. Maximal degree in co-relation 24877. Up to 3519 conditions per place. [2024-12-02 12:01:34,249 INFO L140 encePairwiseOnDemand]: 205/219 looper letters, 124 selfloop transitions, 22 changer transitions 10/302 dead transitions. [2024-12-02 12:01:34,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 302 transitions, 1355 flow [2024-12-02 12:01:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 12:01:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-12-02 12:01:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3177 transitions. [2024-12-02 12:01:34,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059360730593608 [2024-12-02 12:01:34,253 INFO L175 Difference]: Start difference. First operand has 233 places, 197 transitions, 728 flow. Second operand 18 states and 3177 transitions. [2024-12-02 12:01:34,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 302 transitions, 1355 flow [2024-12-02 12:01:34,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 302 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-12-02 12:01:34,316 INFO L231 Difference]: Finished difference. Result has 244 places, 197 transitions, 755 flow [2024-12-02 12:01:34,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=755, PETRI_PLACES=244, PETRI_TRANSITIONS=197} [2024-12-02 12:01:34,317 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 75 predicate places. [2024-12-02 12:01:34,317 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 197 transitions, 755 flow [2024-12-02 12:01:34,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 171.83333333333334) internal successors, (2062), 12 states have internal predecessors, (2062), 0 states have call successors, (0), 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-12-02 12:01:34,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:34,318 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:34,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 12:01:34,318 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1487062924, now seen corresponding path program 3 times [2024-12-02 12:01:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855555191] [2024-12-02 12:01:34,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 12:01:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:34,380 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-12-02 12:01:34,380 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:01:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 12:01:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855555191] [2024-12-02 12:01:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855555191] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:01:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:01:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 12:01:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773227810] [2024-12-02 12:01:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:01:34,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:01:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:34,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:01:34,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:01:35,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 219 [2024-12-02 12:01:35,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 197 transitions, 755 flow. Second operand has 11 states, 11 states have (on average 171.8181818181818) internal successors, (1890), 11 states have internal predecessors, (1890), 0 states have call successors, (0), 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-12-02 12:01:35,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:35,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 219 [2024-12-02 12:01:35,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:37,532 INFO L124 PetriNetUnfolderBase]: 2716/10873 cut-off events. [2024-12-02 12:01:37,532 INFO L125 PetriNetUnfolderBase]: For 8864/8900 co-relation queries the response was YES. [2024-12-02 12:01:37,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23832 conditions, 10873 events. 2716/10873 cut-off events. For 8864/8900 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 107850 event pairs, 221 based on Foata normal form. 48/10830 useless extension candidates. Maximal degree in co-relation 21218. Up to 2793 conditions per place. [2024-12-02 12:01:37,572 INFO L140 encePairwiseOnDemand]: 205/219 looper letters, 116 selfloop transitions, 22 changer transitions 10/294 dead transitions. [2024-12-02 12:01:37,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 294 transitions, 1341 flow [2024-12-02 12:01:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 12:01:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-12-02 12:01:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2662 transitions. [2024-12-02 12:01:37,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8103500761035007 [2024-12-02 12:01:37,574 INFO L175 Difference]: Start difference. First operand has 244 places, 197 transitions, 755 flow. Second operand 15 states and 2662 transitions. [2024-12-02 12:01:37,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 294 transitions, 1341 flow [2024-12-02 12:01:37,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 294 transitions, 1299 flow, removed 0 selfloop flow, removed 17 redundant places. [2024-12-02 12:01:37,610 INFO L231 Difference]: Finished difference. Result has 242 places, 197 transitions, 761 flow [2024-12-02 12:01:37,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=761, PETRI_PLACES=242, PETRI_TRANSITIONS=197} [2024-12-02 12:01:37,611 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 73 predicate places. [2024-12-02 12:01:37,611 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 197 transitions, 761 flow [2024-12-02 12:01:37,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 171.8181818181818) internal successors, (1890), 11 states have internal predecessors, (1890), 0 states have call successors, (0), 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-12-02 12:01:37,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:37,611 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:37,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 12:01:37,611 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -510025956, now seen corresponding path program 4 times [2024-12-02 12:01:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912880284] [2024-12-02 12:01:37,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 12:01:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:37,646 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 12:01:37,646 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:01:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 12:01:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912880284] [2024-12-02 12:01:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912880284] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:01:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083075205] [2024-12-02 12:01:38,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 12:01:38,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:01:38,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:01:38,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:01:38,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 12:01:38,476 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 12:01:38,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:01:38,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 12:01:38,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:01:38,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 12:01:38,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-12-02 12:01:39,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-12-02 12:01:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-02 12:01:39,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:01:39,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-12-02 12:01:39,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-12-02 12:01:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-02 12:01:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083075205] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:01:39,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:01:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22, 22] total 36 [2024-12-02 12:01:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483584720] [2024-12-02 12:01:39,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:01:39,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 12:01:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:39,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 12:01:39,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 12:01:44,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 219 [2024-12-02 12:01:44,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 197 transitions, 761 flow. Second operand has 36 states, 36 states have (on average 164.77777777777777) internal successors, (5932), 36 states have internal predecessors, (5932), 0 states have call successors, (0), 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-12-02 12:01:44,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:01:44,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 219 [2024-12-02 12:01:44,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:01:48,468 INFO L124 PetriNetUnfolderBase]: 2760/8948 cut-off events. [2024-12-02 12:01:48,468 INFO L125 PetriNetUnfolderBase]: For 7581/7609 co-relation queries the response was YES. [2024-12-02 12:01:48,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20276 conditions, 8948 events. 2760/8948 cut-off events. For 7581/7609 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 80983 event pairs, 26 based on Foata normal form. 57/8931 useless extension candidates. Maximal degree in co-relation 18149. Up to 1417 conditions per place. [2024-12-02 12:01:48,519 INFO L140 encePairwiseOnDemand]: 197/219 looper letters, 266 selfloop transitions, 45 changer transitions 12/444 dead transitions. [2024-12-02 12:01:48,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 444 transitions, 2154 flow [2024-12-02 12:01:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-12-02 12:01:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2024-12-02 12:01:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 7087 transitions. [2024-12-02 12:01:48,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7704935855620787 [2024-12-02 12:01:48,525 INFO L175 Difference]: Start difference. First operand has 242 places, 197 transitions, 761 flow. Second operand 42 states and 7087 transitions. [2024-12-02 12:01:48,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 444 transitions, 2154 flow [2024-12-02 12:01:48,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 444 transitions, 2099 flow, removed 5 selfloop flow, removed 16 redundant places. [2024-12-02 12:01:48,568 INFO L231 Difference]: Finished difference. Result has 270 places, 197 transitions, 807 flow [2024-12-02 12:01:48,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=807, PETRI_PLACES=270, PETRI_TRANSITIONS=197} [2024-12-02 12:01:48,568 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 101 predicate places. [2024-12-02 12:01:48,568 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 197 transitions, 807 flow [2024-12-02 12:01:48,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 164.77777777777777) internal successors, (5932), 36 states have internal predecessors, (5932), 0 states have call successors, (0), 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-12-02 12:01:48,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:01:48,570 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:01:48,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 12:01:48,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-12-02 12:01:48,771 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:01:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:01:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1741330601, now seen corresponding path program 1 times [2024-12-02 12:01:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:01:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630433399] [2024-12-02 12:01:48,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:01:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 12:01:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:01:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630433399] [2024-12-02 12:01:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630433399] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:01:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516561465] [2024-12-02 12:01:49,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:01:49,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:01:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:01:49,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:01:49,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 12:01:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:01:50,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 12:01:50,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:01:50,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 12:01:50,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-12-02 12:01:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 12:01:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 12:01:51,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:01:51,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-12-02 12:01:51,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-12-02 12:01:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 12:01:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516561465] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:01:52,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:01:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 23] total 71 [2024-12-02 12:01:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206875367] [2024-12-02 12:01:52,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:01:52,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-12-02 12:01:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:01:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-12-02 12:01:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=4642, Unknown=0, NotChecked=0, Total=4970 [2024-12-02 12:02:02,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 219 [2024-12-02 12:02:02,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 197 transitions, 807 flow. Second operand has 71 states, 71 states have (on average 165.01408450704224) internal successors, (11716), 71 states have internal predecessors, (11716), 0 states have call successors, (0), 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-12-02 12:02:02,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:02:02,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 219 [2024-12-02 12:02:02,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:02:06,180 INFO L124 PetriNetUnfolderBase]: 2527/8508 cut-off events. [2024-12-02 12:02:06,180 INFO L125 PetriNetUnfolderBase]: For 9019/9047 co-relation queries the response was YES. [2024-12-02 12:02:06,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20366 conditions, 8508 events. 2527/8508 cut-off events. For 9019/9047 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 76883 event pairs, 32 based on Foata normal form. 9/8363 useless extension candidates. Maximal degree in co-relation 18079. Up to 1305 conditions per place. [2024-12-02 12:02:06,215 INFO L140 encePairwiseOnDemand]: 200/219 looper letters, 210 selfloop transitions, 35 changer transitions 16/383 dead transitions. [2024-12-02 12:02:06,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 383 transitions, 1913 flow [2024-12-02 12:02:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-12-02 12:02:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-12-02 12:02:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5770 transitions. [2024-12-02 12:02:06,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749127048079506 [2024-12-02 12:02:06,218 INFO L175 Difference]: Start difference. First operand has 270 places, 197 transitions, 807 flow. Second operand 34 states and 5770 transitions. [2024-12-02 12:02:06,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 383 transitions, 1913 flow [2024-12-02 12:02:06,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 383 transitions, 1810 flow, removed 6 selfloop flow, removed 39 redundant places. [2024-12-02 12:02:06,255 INFO L231 Difference]: Finished difference. Result has 265 places, 197 transitions, 778 flow [2024-12-02 12:02:06,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=778, PETRI_PLACES=265, PETRI_TRANSITIONS=197} [2024-12-02 12:02:06,256 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 96 predicate places. [2024-12-02 12:02:06,256 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 197 transitions, 778 flow [2024-12-02 12:02:06,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 165.01408450704224) internal successors, (11716), 71 states have internal predecessors, (11716), 0 states have call successors, (0), 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-12-02 12:02:06,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:02:06,258 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:02:06,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 12:02:06,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-12-02 12:02:06,459 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:02:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:02:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1194800657, now seen corresponding path program 2 times [2024-12-02 12:02:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:02:06,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895455655] [2024-12-02 12:02:06,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:02:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:02:06,501 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:02:06,501 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:02:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 12:02:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:02:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895455655] [2024-12-02 12:02:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895455655] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:02:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352363031] [2024-12-02 12:02:07,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:02:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:02:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:02:07,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:02:07,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 12:02:08,305 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:02:08,305 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:02:08,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 12:02:08,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:02:08,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 12:02:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-12-02 12:02:09,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-12-02 12:02:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 12:02:09,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:02:09,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-12-02 12:02:09,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-12-02 12:02:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 12:02:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352363031] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:02:10,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:02:10,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 24] total 74 [2024-12-02 12:02:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371549591] [2024-12-02 12:02:10,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:02:10,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-12-02 12:02:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:02:10,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-12-02 12:02:10,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=5132, Unknown=0, NotChecked=0, Total=5402 [2024-12-02 12:02:25,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 219 [2024-12-02 12:02:25,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 197 transitions, 778 flow. Second operand has 74 states, 74 states have (on average 162.0810810810811) internal successors, (11994), 74 states have internal predecessors, (11994), 0 states have call successors, (0), 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-12-02 12:02:25,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:02:25,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 219 [2024-12-02 12:02:25,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:02:30,145 INFO L124 PetriNetUnfolderBase]: 2601/8603 cut-off events. [2024-12-02 12:02:30,146 INFO L125 PetriNetUnfolderBase]: For 7970/7984 co-relation queries the response was YES. [2024-12-02 12:02:30,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20034 conditions, 8603 events. 2601/8603 cut-off events. For 7970/7984 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 77405 event pairs, 77 based on Foata normal form. 9/8498 useless extension candidates. Maximal degree in co-relation 17978. Up to 1342 conditions per place. [2024-12-02 12:02:30,218 INFO L140 encePairwiseOnDemand]: 197/219 looper letters, 221 selfloop transitions, 41 changer transitions 26/404 dead transitions. [2024-12-02 12:02:30,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 404 transitions, 1992 flow [2024-12-02 12:02:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-12-02 12:02:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2024-12-02 12:02:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 6490 transitions. [2024-12-02 12:02:30,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7598641845217188 [2024-12-02 12:02:30,222 INFO L175 Difference]: Start difference. First operand has 265 places, 197 transitions, 778 flow. Second operand 39 states and 6490 transitions. [2024-12-02 12:02:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 404 transitions, 1992 flow [2024-12-02 12:02:30,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 404 transitions, 1894 flow, removed 7 selfloop flow, removed 37 redundant places. [2024-12-02 12:02:30,256 INFO L231 Difference]: Finished difference. Result has 266 places, 194 transitions, 748 flow [2024-12-02 12:02:30,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=748, PETRI_PLACES=266, PETRI_TRANSITIONS=194} [2024-12-02 12:02:30,257 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 97 predicate places. [2024-12-02 12:02:30,257 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 194 transitions, 748 flow [2024-12-02 12:02:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 162.0810810810811) internal successors, (11994), 74 states have internal predecessors, (11994), 0 states have call successors, (0), 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-12-02 12:02:30,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:02:30,258 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:02:30,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 12:02:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:02:30,459 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:02:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:02:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1070825418, now seen corresponding path program 1 times [2024-12-02 12:02:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:02:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231235211] [2024-12-02 12:02:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:02:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:02:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:02:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-02 12:02:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:02:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231235211] [2024-12-02 12:02:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231235211] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:02:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118697303] [2024-12-02 12:02:31,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:02:31,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:02:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:02:31,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:02:31,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 12:02:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:02:32,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-12-02 12:02:32,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:02:32,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 12:02:32,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:02:32,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 12:02:32,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-12-02 12:02:32,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 12:02:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-02 12:02:32,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:02:33,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-12-02 12:02:33,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-12-02 12:02:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-02 12:02:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118697303] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:02:33,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:02:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 21] total 61 [2024-12-02 12:02:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192372985] [2024-12-02 12:02:33,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:02:33,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-12-02 12:02:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:02:33,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-12-02 12:02:33,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3377, Unknown=0, NotChecked=0, Total=3660 [2024-12-02 12:02:45,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 219 [2024-12-02 12:02:45,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 194 transitions, 748 flow. Second operand has 61 states, 61 states have (on average 165.18032786885246) internal successors, (10076), 61 states have internal predecessors, (10076), 0 states have call successors, (0), 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-12-02 12:02:45,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:02:45,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 219 [2024-12-02 12:02:45,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:02:49,327 INFO L124 PetriNetUnfolderBase]: 2479/8744 cut-off events. [2024-12-02 12:02:49,327 INFO L125 PetriNetUnfolderBase]: For 8299/8319 co-relation queries the response was YES. [2024-12-02 12:02:49,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20075 conditions, 8744 events. 2479/8744 cut-off events. For 8299/8319 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 79641 event pairs, 150 based on Foata normal form. 24/8555 useless extension candidates. Maximal degree in co-relation 18053. Up to 1293 conditions per place. [2024-12-02 12:02:49,356 INFO L140 encePairwiseOnDemand]: 199/219 looper letters, 180 selfloop transitions, 33 changer transitions 12/344 dead transitions. [2024-12-02 12:02:49,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 344 transitions, 1669 flow [2024-12-02 12:02:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 12:02:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-12-02 12:02:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5084 transitions. [2024-12-02 12:02:49,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7738203957382039 [2024-12-02 12:02:49,360 INFO L175 Difference]: Start difference. First operand has 266 places, 194 transitions, 748 flow. Second operand 30 states and 5084 transitions. [2024-12-02 12:02:49,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 344 transitions, 1669 flow [2024-12-02 12:02:49,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 344 transitions, 1582 flow, removed 0 selfloop flow, removed 39 redundant places. [2024-12-02 12:02:49,396 INFO L231 Difference]: Finished difference. Result has 259 places, 197 transitions, 760 flow [2024-12-02 12:02:49,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=760, PETRI_PLACES=259, PETRI_TRANSITIONS=197} [2024-12-02 12:02:49,397 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 90 predicate places. [2024-12-02 12:02:49,397 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 197 transitions, 760 flow [2024-12-02 12:02:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 165.18032786885246) internal successors, (10076), 61 states have internal predecessors, (10076), 0 states have call successors, (0), 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-12-02 12:02:49,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:02:49,398 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:02:49,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 12:02:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:02:49,598 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:02:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:02:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 240213418, now seen corresponding path program 2 times [2024-12-02 12:02:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:02:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202496011] [2024-12-02 12:02:49,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:02:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:02:49,627 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:02:49,628 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:02:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 12:02:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:02:50,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202496011] [2024-12-02 12:02:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202496011] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:02:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242704324] [2024-12-02 12:02:50,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 12:02:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:02:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:02:50,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:02:50,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 12:02:51,413 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 12:02:51,413 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 12:02:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 12:02:51,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:02:51,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 12:02:51,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:02:51,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 12:02:52,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-12-02 12:02:52,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 12:02:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 12:02:52,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:02:52,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-12-02 12:02:52,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-12-02 12:02:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 12:02:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242704324] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:02:53,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:02:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 65 [2024-12-02 12:02:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626811339] [2024-12-02 12:02:53,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:02:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-12-02 12:02:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:02:53,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-12-02 12:02:53,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3862, Unknown=0, NotChecked=0, Total=4160 [2024-12-02 12:02:56,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:02:59,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:01,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:04,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:06,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:09,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:12,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:16,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:18,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:21,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:26,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:29,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:31,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:36,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:38,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:40,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-02 12:03:40,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 219 [2024-12-02 12:03:40,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 197 transitions, 760 flow. Second operand has 65 states, 65 states have (on average 149.2153846153846) internal successors, (9699), 65 states have internal predecessors, (9699), 0 states have call successors, (0), 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-12-02 12:03:40,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:03:40,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 219 [2024-12-02 12:03:40,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:03:44,704 INFO L124 PetriNetUnfolderBase]: 3219/9221 cut-off events. [2024-12-02 12:03:44,704 INFO L125 PetriNetUnfolderBase]: For 8742/8754 co-relation queries the response was YES. [2024-12-02 12:03:44,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22157 conditions, 9221 events. 3219/9221 cut-off events. For 8742/8754 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 81935 event pairs, 185 based on Foata normal form. 24/8986 useless extension candidates. Maximal degree in co-relation 20554. Up to 1669 conditions per place. [2024-12-02 12:03:44,738 INFO L140 encePairwiseOnDemand]: 199/219 looper letters, 196 selfloop transitions, 34 changer transitions 15/347 dead transitions. [2024-12-02 12:03:44,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 347 transitions, 1691 flow [2024-12-02 12:03:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-02 12:03:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-12-02 12:03:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4739 transitions. [2024-12-02 12:03:44,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6980409485933127 [2024-12-02 12:03:44,741 INFO L175 Difference]: Start difference. First operand has 259 places, 197 transitions, 760 flow. Second operand 31 states and 4739 transitions. [2024-12-02 12:03:44,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 347 transitions, 1691 flow [2024-12-02 12:03:44,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 347 transitions, 1611 flow, removed 9 selfloop flow, removed 28 redundant places. [2024-12-02 12:03:44,780 INFO L231 Difference]: Finished difference. Result has 261 places, 194 transitions, 732 flow [2024-12-02 12:03:44,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=732, PETRI_PLACES=261, PETRI_TRANSITIONS=194} [2024-12-02 12:03:44,781 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 92 predicate places. [2024-12-02 12:03:44,781 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 194 transitions, 732 flow [2024-12-02 12:03:44,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 149.2153846153846) internal successors, (9699), 65 states have internal predecessors, (9699), 0 states have call successors, (0), 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-12-02 12:03:44,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:03:44,782 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:03:44,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 12:03:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-12-02 12:03:44,982 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:03:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:03:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1944421617, now seen corresponding path program 1 times [2024-12-02 12:03:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:03:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743138350] [2024-12-02 12:03:44,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:03:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:03:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:03:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 12:03:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:03:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743138350] [2024-12-02 12:03:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743138350] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:03:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413202697] [2024-12-02 12:03:45,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:03:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:03:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:03:45,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:03:45,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 12:03:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:03:46,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 12:03:46,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:03:46,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 12:03:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:03:46,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 12:03:46,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 12:03:46,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 12:03:46,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-12-02 12:03:47,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 12:03:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 12:03:47,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:03:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-12-02 12:03:49,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-12-02 12:03:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-02 12:03:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413202697] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:03:49,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:03:49,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 54 [2024-12-02 12:03:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796106093] [2024-12-02 12:03:49,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:03:49,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-12-02 12:03:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:03:49,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-12-02 12:03:49,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2599, Unknown=1, NotChecked=0, Total=2862 [2024-12-02 12:04:00,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 219 [2024-12-02 12:04:00,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 194 transitions, 732 flow. Second operand has 54 states, 54 states have (on average 165.24074074074073) internal successors, (8923), 54 states have internal predecessors, (8923), 0 states have call successors, (0), 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-12-02 12:04:00,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 12:04:00,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 219 [2024-12-02 12:04:00,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 12:04:03,687 INFO L124 PetriNetUnfolderBase]: 2139/7783 cut-off events. [2024-12-02 12:04:03,687 INFO L125 PetriNetUnfolderBase]: For 7805/7811 co-relation queries the response was YES. [2024-12-02 12:04:03,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17316 conditions, 7783 events. 2139/7783 cut-off events. For 7805/7811 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 70420 event pairs, 258 based on Foata normal form. 20/7561 useless extension candidates. Maximal degree in co-relation 16710. Up to 1268 conditions per place. [2024-12-02 12:04:03,711 INFO L140 encePairwiseOnDemand]: 199/219 looper letters, 113 selfloop transitions, 30 changer transitions 37/293 dead transitions. [2024-12-02 12:04:03,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 293 transitions, 1383 flow [2024-12-02 12:04:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 12:04:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-12-02 12:04:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4548 transitions. [2024-12-02 12:04:03,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7691527143581938 [2024-12-02 12:04:03,714 INFO L175 Difference]: Start difference. First operand has 261 places, 194 transitions, 732 flow. Second operand 27 states and 4548 transitions. [2024-12-02 12:04:03,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 293 transitions, 1383 flow [2024-12-02 12:04:03,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 293 transitions, 1301 flow, removed 4 selfloop flow, removed 33 redundant places. [2024-12-02 12:04:03,746 INFO L231 Difference]: Finished difference. Result has 254 places, 191 transitions, 693 flow [2024-12-02 12:04:03,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=693, PETRI_PLACES=254, PETRI_TRANSITIONS=191} [2024-12-02 12:04:03,747 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 85 predicate places. [2024-12-02 12:04:03,747 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 191 transitions, 693 flow [2024-12-02 12:04:03,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 165.24074074074073) internal successors, (8923), 54 states have internal predecessors, (8923), 0 states have call successors, (0), 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-12-02 12:04:03,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 12:04:03,748 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:04:03,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 12:04:03,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-12-02 12:04:03,949 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-12-02 12:04:03,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:04:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1330430740, now seen corresponding path program 1 times [2024-12-02 12:04:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:04:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041168926] [2024-12-02 12:04:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:04:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:04:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 12:04:03,979 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 12:04:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 12:04:04,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 12:04:04,052 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 12:04:04,052 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-12-02 12:04:04,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-12-02 12:04:04,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-12-02 12:04:04,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-12-02 12:04:04,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 12:04:04,053 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:04:04,379 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2024-12-02 12:04:04,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 12:04:04,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:04:04 BasicIcfg [2024-12-02 12:04:04,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 12:04:04,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 12:04:04,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 12:04:04,399 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 12:04:04,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:01" (3/4) ... [2024-12-02 12:04:04,402 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 12:04:04,665 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 11. [2024-12-02 12:04:04,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 12:04:04,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 12:04:04,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 12:04:04,721 INFO L158 Benchmark]: Toolchain (without parser) took 304226.14ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 115.9MB in the beginning and 216.6MB in the end (delta: -100.7MB). Peak memory consumption was 256.9MB. Max. memory is 16.1GB. [2024-12-02 12:04:04,721 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 142.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:04:04,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.67ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 96.5MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 12:04:04,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.01ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 12:04:04,722 INFO L158 Benchmark]: Boogie Preprocessor took 30.88ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 12:04:04,722 INFO L158 Benchmark]: RCFGBuilder took 449.50ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 12:04:04,722 INFO L158 Benchmark]: TraceAbstraction took 302880.39ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 77.2MB in the beginning and 342.7MB in the end (delta: -265.5MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. [2024-12-02 12:04:04,723 INFO L158 Benchmark]: Witness Printer took 321.06ms. Allocated memory is still 503.3MB. Free memory was 342.7MB in the beginning and 216.6MB in the end (delta: 126.1MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2024-12-02 12:04:04,724 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 142.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.67ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 96.5MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.01ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.88ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 449.50ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 302880.39ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 77.2MB in the beginning and 342.7MB in the end (delta: -265.5MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. * Witness Printer took 321.06ms. Allocated memory is still 503.3MB. Free memory was 342.7MB in the beginning and 216.6MB in the end (delta: 126.1MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] 0 pthread_create(&tids[0], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L695] FCALL, FORK 0 pthread_create(&tids[0], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 5 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] 0 int i = 0; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L687] 5 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L697] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L697] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L697] FCALL, JOIN 5 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L696] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L697] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L697] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L687] 2 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L697] FCALL, JOIN 2 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L696] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L697] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L687] 3 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L697] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L697] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L696] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L697] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L697] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L687] 4 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L697] FCALL, JOIN 4 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L696] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L696] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L699] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [699] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 126 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 281 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 14 mSDtfsCounter, 281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 6 procedures, 160 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 89 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 8 procedures, 194 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.2s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 628 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 37 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 10 procedures, 228 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 274.4s, OverallIterations: 29, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 246.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 17571 SdHoareTripleChecker+Valid, 116.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16570 mSDsluCounter, 42964 SdHoareTripleChecker+Invalid, 104.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42652 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214748 IncrementalHoareTripleChecker+Invalid, 214903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 312 mSDtfsCounter, 214748 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3603 GetRequests, 2912 SyntacticMatches, 6 SemanticMatches, 685 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13979 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=807occurred in iteration=23, InterpolantAutomatonStates: 381, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 5382 NumberOfCodeBlocks, 5364 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 6654 ConstructedInterpolants, 81 QuantifiedInterpolants, 49152 SizeOfPredicates, 133 NumberOfNonLiveVariables, 4135 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 42 InterpolantComputations, 21 PerfectInterpolantSequences, 614/1028 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 12:04:04,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d26c8f3-0c4e-48b5-a057-3b31941c28e1/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)