./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:13:17,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:13:18,031 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 05:13:18,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:13:18,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:13:18,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:13:18,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:13:18,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:13:18,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:13:18,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:13:18,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:13:18,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:13:18,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:13:18,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:13:18,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:13:18,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:13:18,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:13:18,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:13:18,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:13:18,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:13:18,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:13:18,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:13:18,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:13:18,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:13:18,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:13:18,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:13:18,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:13:18,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:13:18,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:13:18,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:13:18,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:13:18,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:13:18,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:13:18,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:13:18,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:13:18,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:13:18,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:13:18,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:13:18,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:13:18,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:13:18,101 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_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2024-11-28 05:13:18,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:13:18,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:13:18,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:13:18,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:13:18,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:13:18,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-28 05:13:22,241 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/data/95364cdd8/418c13aeb3904f6890fea25096daa768/FLAG76c70f6fa [2024-11-28 05:13:22,673 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:13:22,674 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-28 05:13:22,689 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/data/95364cdd8/418c13aeb3904f6890fea25096daa768/FLAG76c70f6fa [2024-11-28 05:13:22,724 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/data/95364cdd8/418c13aeb3904f6890fea25096daa768 [2024-11-28 05:13:22,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:13:22,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:13:22,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:13:22,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:13:22,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:13:22,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:13:22" (1/1) ... [2024-11-28 05:13:22,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2749067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:22, skipping insertion in model container [2024-11-28 05:13:22,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:13:22" (1/1) ... [2024-11-28 05:13:22,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:13:23,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:13:23,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:13:23,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:13:23,233 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:13:23,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23 WrapperNode [2024-11-28 05:13:23,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:13:23,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:13:23,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:13:23,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:13:23,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,324 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 482 [2024-11-28 05:13:23,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:13:23,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:13:23,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:13:23,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:13:23,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:13:23,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:13:23,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:13:23,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:13:23,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (1/1) ... [2024-11-28 05:13:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:13:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:13:23,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:13:23,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:13:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:13:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 05:13:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 05:13:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 05:13:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 05:13:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 05:13:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 05:13:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 05:13:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 05:13:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:13:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:13:23,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:13:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 05:13:23,537 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:13:23,743 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:13:23,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:13:25,152 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:13:25,152 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:13:25,204 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:13:25,209 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 05:13:25,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:13:25 BoogieIcfgContainer [2024-11-28 05:13:25,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:13:25,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:13:25,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:13:25,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:13:25,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:13:22" (1/3) ... [2024-11-28 05:13:25,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d150701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:13:25, skipping insertion in model container [2024-11-28 05:13:25,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:13:23" (2/3) ... [2024-11-28 05:13:25,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d150701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:13:25, skipping insertion in model container [2024-11-28 05:13:25,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:13:25" (3/3) ... [2024-11-28 05:13:25,224 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2024-11-28 05:13:25,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:13:25,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 599 locations, 1 initial locations, 6 loop locations, and 59 error locations. [2024-11-28 05:13:25,255 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:13:25,663 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 05:13:25,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 631 transitions, 1283 flow [2024-11-28 05:13:26,253 INFO L124 PetriNetUnfolderBase]: 33/628 cut-off events. [2024-11-28 05:13:26,261 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 05:13:26,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 628 events. 33/628 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1513 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2024-11-28 05:13:26,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 631 transitions, 1283 flow [2024-11-28 05:13:26,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 608 transitions, 1234 flow [2024-11-28 05:13:26,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:13:26,351 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;@4f8fcaa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:13:26,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-28 05:13:26,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:13:26,363 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-28 05:13:26,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:13:26,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:26,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:26,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1433922089, now seen corresponding path program 1 times [2024-11-28 05:13:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894572019] [2024-11-28 05:13:26,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:26,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894572019] [2024-11-28 05:13:26,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894572019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:26,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:26,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084883082] [2024-11-28 05:13:26,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:26,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:26,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:26,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:26,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-28 05:13:26,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 608 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:26,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:26,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-28 05:13:26,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:27,607 INFO L124 PetriNetUnfolderBase]: 56/1488 cut-off events. [2024-11-28 05:13:27,607 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-28 05:13:27,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1488 events. 56/1488 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8308 event pairs, 20 based on Foata normal form. 42/1290 useless extension candidates. Maximal degree in co-relation 1200. Up to 51 conditions per place. [2024-11-28 05:13:27,648 INFO L140 encePairwiseOnDemand]: 609/631 looper letters, 14 selfloop transitions, 2 changer transitions 7/588 dead transitions. [2024-11-28 05:13:27,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1226 flow [2024-11-28 05:13:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2024-11-28 05:13:27,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572107765451664 [2024-11-28 05:13:27,684 INFO L175 Difference]: Start difference. First operand has 587 places, 608 transitions, 1234 flow. Second operand 3 states and 1812 transitions. [2024-11-28 05:13:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1226 flow [2024-11-28 05:13:27,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 05:13:27,723 INFO L231 Difference]: Finished difference. Result has 582 places, 581 transitions, 1172 flow [2024-11-28 05:13:27,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=582, PETRI_TRANSITIONS=581} [2024-11-28 05:13:27,734 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2024-11-28 05:13:27,734 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 581 transitions, 1172 flow [2024-11-28 05:13:27,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:27,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:27,739 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] [2024-11-28 05:13:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:13:27,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -352643535, now seen corresponding path program 1 times [2024-11-28 05:13:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:27,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542634812] [2024-11-28 05:13:27,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542634812] [2024-11-28 05:13:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542634812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:27,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:27,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477357361] [2024-11-28 05:13:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:27,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:27,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:27,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-28 05:13:27,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 581 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:27,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:27,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-28 05:13:27,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:28,551 INFO L124 PetriNetUnfolderBase]: 36/1024 cut-off events. [2024-11-28 05:13:28,552 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 05:13:28,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 1024 events. 36/1024 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4560 event pairs, 12 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1042. Up to 39 conditions per place. [2024-11-28 05:13:28,576 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 14 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-28 05:13:28,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2024-11-28 05:13:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-28 05:13:28,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471737982039091 [2024-11-28 05:13:28,587 INFO L175 Difference]: Start difference. First operand has 582 places, 581 transitions, 1172 flow. Second operand 3 states and 1793 transitions. [2024-11-28 05:13:28,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2024-11-28 05:13:28,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:28,604 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1170 flow [2024-11-28 05:13:28,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2024-11-28 05:13:28,607 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2024-11-28 05:13:28,608 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1170 flow [2024-11-28 05:13:28,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:28,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:28,610 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] [2024-11-28 05:13:28,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:13:28,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:28,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1983381802, now seen corresponding path program 1 times [2024-11-28 05:13:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212513818] [2024-11-28 05:13:28,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212513818] [2024-11-28 05:13:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212513818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223858333] [2024-11-28 05:13:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:28,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:28,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:28,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:28,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-28 05:13:28,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:28,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:28,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-28 05:13:28,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:29,361 INFO L124 PetriNetUnfolderBase]: 56/1455 cut-off events. [2024-11-28 05:13:29,361 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-11-28 05:13:29,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1455 events. 56/1455 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7762 event pairs, 20 based on Foata normal form. 0/1232 useless extension candidates. Maximal degree in co-relation 1475. Up to 51 conditions per place. [2024-11-28 05:13:29,402 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2024-11-28 05:13:29,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1200 flow [2024-11-28 05:13:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-28 05:13:29,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471737982039091 [2024-11-28 05:13:29,410 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1170 flow. Second operand 3 states and 1793 transitions. [2024-11-28 05:13:29,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1200 flow [2024-11-28 05:13:29,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:29,425 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1168 flow [2024-11-28 05:13:29,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2024-11-28 05:13:29,428 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -14 predicate places. [2024-11-28 05:13:29,428 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1168 flow [2024-11-28 05:13:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:29,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:29,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:29,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:13:29,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1393779629, now seen corresponding path program 1 times [2024-11-28 05:13:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:29,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562711725] [2024-11-28 05:13:29,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562711725] [2024-11-28 05:13:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562711725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:29,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:29,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304107445] [2024-11-28 05:13:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:29,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:29,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:29,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:29,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-28 05:13:29,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:29,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:29,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-28 05:13:29,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:30,438 INFO L124 PetriNetUnfolderBase]: 132/2496 cut-off events. [2024-11-28 05:13:30,438 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 05:13:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 2496 events. 132/2496 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18517 event pairs, 64 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2621. Up to 138 conditions per place. [2024-11-28 05:13:30,499 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2024-11-28 05:13:30,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1192 flow [2024-11-28 05:13:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-28 05:13:30,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-28 05:13:30,507 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1168 flow. Second operand 3 states and 1786 transitions. [2024-11-28 05:13:30,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1192 flow [2024-11-28 05:13:30,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:30,527 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2024-11-28 05:13:30,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2024-11-28 05:13:30,529 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-28 05:13:30,529 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2024-11-28 05:13:30,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:30,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:30,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:30,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:13:30,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:30,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1145392566, now seen corresponding path program 1 times [2024-11-28 05:13:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:30,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572723240] [2024-11-28 05:13:30,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572723240] [2024-11-28 05:13:30,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572723240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:30,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:30,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870124220] [2024-11-28 05:13:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:30,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:30,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:30,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:30,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-28 05:13:30,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:30,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:30,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-28 05:13:30,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:31,284 INFO L124 PetriNetUnfolderBase]: 62/1747 cut-off events. [2024-11-28 05:13:31,285 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-28 05:13:31,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 1747 events. 62/1747 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9903 event pairs, 20 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2024-11-28 05:13:31,320 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-28 05:13:31,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 573 transitions, 1184 flow [2024-11-28 05:13:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-28 05:13:31,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-28 05:13:31,327 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 3 states and 1795 transitions. [2024-11-28 05:13:31,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 573 transitions, 1184 flow [2024-11-28 05:13:31,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 573 transitions, 1183 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:13:31,341 INFO L231 Difference]: Finished difference. Result has 568 places, 573 transitions, 1157 flow [2024-11-28 05:13:31,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1157, PETRI_PLACES=568, PETRI_TRANSITIONS=573} [2024-11-28 05:13:31,346 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-28 05:13:31,346 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 573 transitions, 1157 flow [2024-11-28 05:13:31,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:31,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:31,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:31,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:13:31,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:31,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1517131780, now seen corresponding path program 1 times [2024-11-28 05:13:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577327529] [2024-11-28 05:13:31,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:32,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577327529] [2024-11-28 05:13:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577327529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:13:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038474102] [2024-11-28 05:13:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:32,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:13:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:32,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:13:32,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:13:33,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 631 [2024-11-28 05:13:33,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 573 transitions, 1157 flow. Second operand has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:33,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:33,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 631 [2024-11-28 05:13:33,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:45,826 INFO L124 PetriNetUnfolderBase]: 12107/56325 cut-off events. [2024-11-28 05:13:45,826 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-28 05:13:46,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73808 conditions, 56325 events. 12107/56325 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 787107 event pairs, 10080 based on Foata normal form. 0/49047 useless extension candidates. Maximal degree in co-relation 73759. Up to 17156 conditions per place. [2024-11-28 05:13:46,309 INFO L140 encePairwiseOnDemand]: 613/631 looper letters, 78 selfloop transitions, 15 changer transitions 0/570 dead transitions. [2024-11-28 05:13:46,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1337 flow [2024-11-28 05:13:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:13:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:13:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3180 transitions. [2024-11-28 05:13:46,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8399366085578447 [2024-11-28 05:13:46,318 INFO L175 Difference]: Start difference. First operand has 568 places, 573 transitions, 1157 flow. Second operand 6 states and 3180 transitions. [2024-11-28 05:13:46,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1337 flow [2024-11-28 05:13:46,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 570 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:46,330 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1177 flow [2024-11-28 05:13:46,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1177, PETRI_PLACES=568, PETRI_TRANSITIONS=570} [2024-11-28 05:13:46,334 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-28 05:13:46,334 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1177 flow [2024-11-28 05:13:46,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:46,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:46,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:46,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:13:46,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash 557572317, now seen corresponding path program 1 times [2024-11-28 05:13:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580790346] [2024-11-28 05:13:46,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:46,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:46,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580790346] [2024-11-28 05:13:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580790346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:46,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578643475] [2024-11-28 05:13:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:46,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:46,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:46,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:46,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-28 05:13:46,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 570 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:46,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:46,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-28 05:13:46,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:47,154 INFO L124 PetriNetUnfolderBase]: 78/1635 cut-off events. [2024-11-28 05:13:47,155 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-28 05:13:47,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1635 events. 78/1635 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9888 event pairs, 32 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1705. Up to 87 conditions per place. [2024-11-28 05:13:47,186 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2024-11-28 05:13:47,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 565 transitions, 1201 flow [2024-11-28 05:13:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-28 05:13:47,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-28 05:13:47,192 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1177 flow. Second operand 3 states and 1786 transitions. [2024-11-28 05:13:47,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 565 transitions, 1201 flow [2024-11-28 05:13:47,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 565 transitions, 1171 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:13:47,204 INFO L231 Difference]: Finished difference. Result has 560 places, 565 transitions, 1139 flow [2024-11-28 05:13:47,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=560, PETRI_TRANSITIONS=565} [2024-11-28 05:13:47,207 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2024-11-28 05:13:47,207 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 565 transitions, 1139 flow [2024-11-28 05:13:47,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:47,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:47,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:13:47,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 266313796, now seen corresponding path program 1 times [2024-11-28 05:13:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:47,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225989959] [2024-11-28 05:13:47,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:47,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225989959] [2024-11-28 05:13:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225989959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:47,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295662708] [2024-11-28 05:13:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:47,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:47,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:47,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:47,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-28 05:13:47,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 565 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:47,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:47,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-28 05:13:47,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:47,634 INFO L124 PetriNetUnfolderBase]: 36/1038 cut-off events. [2024-11-28 05:13:47,634 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-28 05:13:47,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 1038 events. 36/1038 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4387 event pairs, 12 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-11-28 05:13:47,652 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2024-11-28 05:13:47,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 564 transitions, 1167 flow [2024-11-28 05:13:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-28 05:13:47,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-28 05:13:47,660 INFO L175 Difference]: Start difference. First operand has 560 places, 565 transitions, 1139 flow. Second operand 3 states and 1795 transitions. [2024-11-28 05:13:47,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 564 transitions, 1167 flow [2024-11-28 05:13:47,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 564 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:13:47,673 INFO L231 Difference]: Finished difference. Result has 560 places, 564 transitions, 1140 flow [2024-11-28 05:13:47,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=560, PETRI_TRANSITIONS=564} [2024-11-28 05:13:47,678 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2024-11-28 05:13:47,678 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 564 transitions, 1140 flow [2024-11-28 05:13:47,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:47,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:47,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:47,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:13:47,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash -581215459, now seen corresponding path program 1 times [2024-11-28 05:13:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:47,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220351149] [2024-11-28 05:13:47,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:47,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220351149] [2024-11-28 05:13:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220351149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125446007] [2024-11-28 05:13:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:47,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:47,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:47,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-28 05:13:47,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 564 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:47,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:47,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-28 05:13:47,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:48,550 INFO L124 PetriNetUnfolderBase]: 136/2442 cut-off events. [2024-11-28 05:13:48,550 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-11-28 05:13:48,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 2442 events. 136/2442 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17712 event pairs, 64 based on Foata normal form. 0/2111 useless extension candidates. Maximal degree in co-relation 2548. Up to 141 conditions per place. [2024-11-28 05:13:48,610 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2024-11-28 05:13:48,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1164 flow [2024-11-28 05:13:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-28 05:13:48,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-28 05:13:48,616 INFO L175 Difference]: Start difference. First operand has 560 places, 564 transitions, 1140 flow. Second operand 3 states and 1786 transitions. [2024-11-28 05:13:48,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1164 flow [2024-11-28 05:13:48,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 559 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:48,627 INFO L231 Difference]: Finished difference. Result has 555 places, 559 transitions, 1128 flow [2024-11-28 05:13:48,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=555, PETRI_TRANSITIONS=559} [2024-11-28 05:13:48,629 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-28 05:13:48,629 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 559 transitions, 1128 flow [2024-11-28 05:13:48,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:48,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:48,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:48,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:13:48,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:48,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:48,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1470839722, now seen corresponding path program 1 times [2024-11-28 05:13:48,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:48,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364075442] [2024-11-28 05:13:48,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364075442] [2024-11-28 05:13:48,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364075442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:48,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:48,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035284009] [2024-11-28 05:13:48,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:48,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:48,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:48,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:48,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-28 05:13:48,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 559 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:48,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:48,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-28 05:13:48,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:49,124 INFO L124 PetriNetUnfolderBase]: 38/810 cut-off events. [2024-11-28 05:13:49,124 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-28 05:13:49,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 810 events. 38/810 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3016 event pairs, 20 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-11-28 05:13:49,142 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-28 05:13:49,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1156 flow [2024-11-28 05:13:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-28 05:13:49,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-28 05:13:49,149 INFO L175 Difference]: Start difference. First operand has 555 places, 559 transitions, 1128 flow. Second operand 3 states and 1795 transitions. [2024-11-28 05:13:49,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1156 flow [2024-11-28 05:13:49,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:13:49,163 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1129 flow [2024-11-28 05:13:49,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2024-11-28 05:13:49,166 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-28 05:13:49,167 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1129 flow [2024-11-28 05:13:49,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:49,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:49,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:49,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:13:49,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:49,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 657887460, now seen corresponding path program 1 times [2024-11-28 05:13:49,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230971020] [2024-11-28 05:13:49,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230971020] [2024-11-28 05:13:49,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230971020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:49,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:49,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916268058] [2024-11-28 05:13:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:49,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:49,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:49,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 631 [2024-11-28 05:13:49,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:49,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:49,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 631 [2024-11-28 05:13:49,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:49,683 INFO L124 PetriNetUnfolderBase]: 34/990 cut-off events. [2024-11-28 05:13:49,683 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 05:13:49,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 990 events. 34/990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4346 event pairs, 6 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 994. Up to 23 conditions per place. [2024-11-28 05:13:49,702 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 12 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-28 05:13:49,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1161 flow [2024-11-28 05:13:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-28 05:13:49,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-28 05:13:49,710 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1129 flow. Second operand 3 states and 1806 transitions. [2024-11-28 05:13:49,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1161 flow [2024-11-28 05:13:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 559 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:49,725 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1127 flow [2024-11-28 05:13:49,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2024-11-28 05:13:49,727 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2024-11-28 05:13:49,727 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1127 flow [2024-11-28 05:13:49,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:49,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:49,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:49,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:13:49,731 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:49,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1445730208, now seen corresponding path program 1 times [2024-11-28 05:13:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883386657] [2024-11-28 05:13:49,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:49,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:49,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883386657] [2024-11-28 05:13:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883386657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:49,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:49,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:49,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593582798] [2024-11-28 05:13:49,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:49,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:49,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:49,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:49,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:49,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:13:49,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:49,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:49,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:13:49,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:50,273 INFO L124 PetriNetUnfolderBase]: 31/876 cut-off events. [2024-11-28 05:13:50,274 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-28 05:13:50,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 876 events. 31/876 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3420 event pairs, 6 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2024-11-28 05:13:50,294 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-28 05:13:50,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 558 transitions, 1161 flow [2024-11-28 05:13:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-28 05:13:50,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-28 05:13:50,301 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1127 flow. Second operand 3 states and 1804 transitions. [2024-11-28 05:13:50,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 558 transitions, 1161 flow [2024-11-28 05:13:50,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:50,315 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1125 flow [2024-11-28 05:13:50,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2024-11-28 05:13:50,318 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2024-11-28 05:13:50,320 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1125 flow [2024-11-28 05:13:50,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:50,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:50,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:13:50,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1048666038, now seen corresponding path program 1 times [2024-11-28 05:13:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614485745] [2024-11-28 05:13:50,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614485745] [2024-11-28 05:13:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614485745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:13:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091010487] [2024-11-28 05:13:50,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:50,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:50,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:50,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:50,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:13:50,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:50,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:50,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:13:50,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:50,840 INFO L124 PetriNetUnfolderBase]: 40/991 cut-off events. [2024-11-28 05:13:50,840 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-28 05:13:50,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 991 events. 40/991 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4277 event pairs, 12 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 1022. Up to 39 conditions per place. [2024-11-28 05:13:50,860 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2024-11-28 05:13:50,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 559 transitions, 1167 flow [2024-11-28 05:13:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-28 05:13:50,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-28 05:13:50,867 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1125 flow. Second operand 3 states and 1806 transitions. [2024-11-28 05:13:50,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 559 transitions, 1167 flow [2024-11-28 05:13:50,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 559 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:50,885 INFO L231 Difference]: Finished difference. Result has 555 places, 557 transitions, 1139 flow [2024-11-28 05:13:50,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=555, PETRI_TRANSITIONS=557} [2024-11-28 05:13:50,888 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-28 05:13:50,888 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 557 transitions, 1139 flow [2024-11-28 05:13:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:50,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:50,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:13:50,891 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1580234942, now seen corresponding path program 1 times [2024-11-28 05:13:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976784624] [2024-11-28 05:13:50,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976784624] [2024-11-28 05:13:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976784624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492569498] [2024-11-28 05:13:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:51,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:51,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:51,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:51,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:13:51,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 557 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:51,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:51,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:13:51,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:51,361 INFO L124 PetriNetUnfolderBase]: 28/766 cut-off events. [2024-11-28 05:13:51,362 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2024-11-28 05:13:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 766 events. 28/766 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2603 event pairs, 6 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 767. Up to 24 conditions per place. [2024-11-28 05:13:51,375 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-28 05:13:51,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1173 flow [2024-11-28 05:13:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-28 05:13:51,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-28 05:13:51,383 INFO L175 Difference]: Start difference. First operand has 555 places, 557 transitions, 1139 flow. Second operand 3 states and 1804 transitions. [2024-11-28 05:13:51,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1173 flow [2024-11-28 05:13:51,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 558 transitions, 1167 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:51,400 INFO L231 Difference]: Finished difference. Result has 554 places, 556 transitions, 1135 flow [2024-11-28 05:13:51,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=554, PETRI_TRANSITIONS=556} [2024-11-28 05:13:51,403 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2024-11-28 05:13:51,404 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 556 transitions, 1135 flow [2024-11-28 05:13:51,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:51,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:51,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:51,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:13:51,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:51,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1876513869, now seen corresponding path program 1 times [2024-11-28 05:13:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600284095] [2024-11-28 05:13:51,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600284095] [2024-11-28 05:13:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600284095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620505927] [2024-11-28 05:13:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:51,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:51,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:51,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-28 05:13:51,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 556 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:51,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:51,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-28 05:13:51,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:52,414 INFO L124 PetriNetUnfolderBase]: 131/2145 cut-off events. [2024-11-28 05:13:52,414 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-28 05:13:52,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 2145 events. 131/2145 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14800 event pairs, 24 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2326. Up to 154 conditions per place. [2024-11-28 05:13:52,458 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 20 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-28 05:13:52,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 559 transitions, 1190 flow [2024-11-28 05:13:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-28 05:13:52,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503433703116746 [2024-11-28 05:13:52,465 INFO L175 Difference]: Start difference. First operand has 554 places, 556 transitions, 1135 flow. Second operand 3 states and 1799 transitions. [2024-11-28 05:13:52,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 559 transitions, 1190 flow [2024-11-28 05:13:52,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 559 transitions, 1186 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:52,480 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1137 flow [2024-11-28 05:13:52,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2024-11-28 05:13:52,482 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -36 predicate places. [2024-11-28 05:13:52,482 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1137 flow [2024-11-28 05:13:52,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:52,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:52,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:52,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:13:52,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:52,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash 935447159, now seen corresponding path program 1 times [2024-11-28 05:13:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:52,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840241949] [2024-11-28 05:13:52,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840241949] [2024-11-28 05:13:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840241949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:13:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975863116] [2024-11-28 05:13:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:13:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:13:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:13:53,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-28 05:13:53,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:53,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:53,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-28 05:13:53,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:54,654 INFO L124 PetriNetUnfolderBase]: 98/1577 cut-off events. [2024-11-28 05:13:54,654 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2024-11-28 05:13:54,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1577 events. 98/1577 cut-off events. For 6/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8583 event pairs, 45 based on Foata normal form. 5/1448 useless extension candidates. Maximal degree in co-relation 1889. Up to 158 conditions per place. [2024-11-28 05:13:54,676 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 69 selfloop transitions, 15 changer transitions 0/592 dead transitions. [2024-11-28 05:13:54,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 592 transitions, 1397 flow [2024-11-28 05:13:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:13:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:13:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2024-11-28 05:13:54,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075061230370264 [2024-11-28 05:13:54,697 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1137 flow. Second operand 11 states and 6299 transitions. [2024-11-28 05:13:54,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 592 transitions, 1397 flow [2024-11-28 05:13:54,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 592 transitions, 1397 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:13:54,713 INFO L231 Difference]: Finished difference. Result has 566 places, 562 transitions, 1213 flow [2024-11-28 05:13:54,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1213, PETRI_PLACES=566, PETRI_TRANSITIONS=562} [2024-11-28 05:13:54,715 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2024-11-28 05:13:54,715 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 562 transitions, 1213 flow [2024-11-28 05:13:54,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:54,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:54,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:54,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:13:54,719 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:54,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1166310555, now seen corresponding path program 1 times [2024-11-28 05:13:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350121224] [2024-11-28 05:13:54,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350121224] [2024-11-28 05:13:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350121224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:54,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:13:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078752102] [2024-11-28 05:13:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:54,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:54,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:54,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:54,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:13:54,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 562 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:54,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:54,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:13:54,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:55,607 INFO L124 PetriNetUnfolderBase]: 137/1981 cut-off events. [2024-11-28 05:13:55,607 INFO L125 PetriNetUnfolderBase]: For 61/94 co-relation queries the response was YES. [2024-11-28 05:13:55,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 1981 events. 137/1981 cut-off events. For 61/94 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12948 event pairs, 48 based on Foata normal form. 0/1767 useless extension candidates. Maximal degree in co-relation 2272. Up to 152 conditions per place. [2024-11-28 05:13:55,657 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2024-11-28 05:13:55,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 565 transitions, 1255 flow [2024-11-28 05:13:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-28 05:13:55,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-28 05:13:55,663 INFO L175 Difference]: Start difference. First operand has 566 places, 562 transitions, 1213 flow. Second operand 3 states and 1806 transitions. [2024-11-28 05:13:55,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 565 transitions, 1255 flow [2024-11-28 05:13:55,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 565 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:13:55,677 INFO L231 Difference]: Finished difference. Result has 569 places, 563 transitions, 1227 flow [2024-11-28 05:13:55,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=569, PETRI_TRANSITIONS=563} [2024-11-28 05:13:55,679 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2024-11-28 05:13:55,679 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 563 transitions, 1227 flow [2024-11-28 05:13:55,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:55,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:55,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:55,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:13:55,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:55,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1148582806, now seen corresponding path program 1 times [2024-11-28 05:13:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:55,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450643226] [2024-11-28 05:13:55,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450643226] [2024-11-28 05:13:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450643226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:13:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173609986] [2024-11-28 05:13:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:55,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:55,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:13:55,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 563 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:55,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:55,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:13:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:56,503 INFO L124 PetriNetUnfolderBase]: 131/1752 cut-off events. [2024-11-28 05:13:56,503 INFO L125 PetriNetUnfolderBase]: For 97/162 co-relation queries the response was YES. [2024-11-28 05:13:56,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 1752 events. 131/1752 cut-off events. For 97/162 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10301 event pairs, 48 based on Foata normal form. 0/1553 useless extension candidates. Maximal degree in co-relation 2009. Up to 149 conditions per place. [2024-11-28 05:13:56,527 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2024-11-28 05:13:56,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 566 transitions, 1269 flow [2024-11-28 05:13:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-28 05:13:56,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-28 05:13:56,532 INFO L175 Difference]: Start difference. First operand has 569 places, 563 transitions, 1227 flow. Second operand 3 states and 1806 transitions. [2024-11-28 05:13:56,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 566 transitions, 1269 flow [2024-11-28 05:13:56,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 566 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:56,547 INFO L231 Difference]: Finished difference. Result has 571 places, 564 transitions, 1239 flow [2024-11-28 05:13:56,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=571, PETRI_TRANSITIONS=564} [2024-11-28 05:13:56,548 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -16 predicate places. [2024-11-28 05:13:56,549 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 564 transitions, 1239 flow [2024-11-28 05:13:56,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:56,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:56,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:56,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:13:56,550 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:56,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1791933331, now seen corresponding path program 1 times [2024-11-28 05:13:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:56,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751067774] [2024-11-28 05:13:56,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:57,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751067774] [2024-11-28 05:13:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751067774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:57,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:13:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28109404] [2024-11-28 05:13:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:57,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:13:57,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:57,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:13:57,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:13:57,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-28 05:13:57,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 564 transitions, 1239 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:57,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:57,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-28 05:13:57,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:58,751 INFO L124 PetriNetUnfolderBase]: 111/1481 cut-off events. [2024-11-28 05:13:58,751 INFO L125 PetriNetUnfolderBase]: For 64/81 co-relation queries the response was YES. [2024-11-28 05:13:58,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 1481 events. 111/1481 cut-off events. For 64/81 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7983 event pairs, 46 based on Foata normal form. 3/1366 useless extension candidates. Maximal degree in co-relation 1838. Up to 174 conditions per place. [2024-11-28 05:13:58,773 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 69 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2024-11-28 05:13:58,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 597 transitions, 1489 flow [2024-11-28 05:13:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:13:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:13:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2024-11-28 05:13:58,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075061230370264 [2024-11-28 05:13:58,783 INFO L175 Difference]: Start difference. First operand has 571 places, 564 transitions, 1239 flow. Second operand 11 states and 6299 transitions. [2024-11-28 05:13:58,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 597 transitions, 1489 flow [2024-11-28 05:13:58,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 597 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:13:58,801 INFO L231 Difference]: Finished difference. Result has 582 places, 567 transitions, 1288 flow [2024-11-28 05:13:58,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1288, PETRI_PLACES=582, PETRI_TRANSITIONS=567} [2024-11-28 05:13:58,802 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2024-11-28 05:13:58,802 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 567 transitions, 1288 flow [2024-11-28 05:13:58,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:58,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:58,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:13:58,805 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1062435085, now seen corresponding path program 1 times [2024-11-28 05:13:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988933015] [2024-11-28 05:13:58,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:13:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988933015] [2024-11-28 05:13:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988933015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:58,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:58,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:13:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248436813] [2024-11-28 05:13:58,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:58,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:13:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:58,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:13:58,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:13:58,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-28 05:13:58,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 567 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:58,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:13:58,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-28 05:13:58,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:13:59,916 INFO L124 PetriNetUnfolderBase]: 140/2795 cut-off events. [2024-11-28 05:13:59,916 INFO L125 PetriNetUnfolderBase]: For 53/82 co-relation queries the response was YES. [2024-11-28 05:13:59,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 2795 events. 140/2795 cut-off events. For 53/82 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19560 event pairs, 23 based on Foata normal form. 1/2520 useless extension candidates. Maximal degree in co-relation 3163. Up to 145 conditions per place. [2024-11-28 05:13:59,958 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 20 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-11-28 05:13:59,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 570 transitions, 1343 flow [2024-11-28 05:13:59,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:13:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:13:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-28 05:13:59,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503433703116746 [2024-11-28 05:13:59,962 INFO L175 Difference]: Start difference. First operand has 582 places, 567 transitions, 1288 flow. Second operand 3 states and 1799 transitions. [2024-11-28 05:13:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 570 transitions, 1343 flow [2024-11-28 05:13:59,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 570 transitions, 1322 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 05:13:59,973 INFO L231 Difference]: Finished difference. Result has 574 places, 565 transitions, 1273 flow [2024-11-28 05:13:59,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1273, PETRI_PLACES=574, PETRI_TRANSITIONS=565} [2024-11-28 05:13:59,974 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2024-11-28 05:13:59,975 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 565 transitions, 1273 flow [2024-11-28 05:13:59,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:13:59,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:13:59,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:13:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:13:59,976 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:13:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1642164881, now seen corresponding path program 1 times [2024-11-28 05:13:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349841816] [2024-11-28 05:13:59,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349841816] [2024-11-28 05:14:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349841816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:14:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024668724] [2024-11-28 05:14:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:14:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:00,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:14:00,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:14:01,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-28 05:14:01,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 565 transitions, 1273 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:01,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:01,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-28 05:14:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:02,434 INFO L124 PetriNetUnfolderBase]: 245/3127 cut-off events. [2024-11-28 05:14:02,434 INFO L125 PetriNetUnfolderBase]: For 214/272 co-relation queries the response was YES. [2024-11-28 05:14:02,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 3127 events. 245/3127 cut-off events. For 214/272 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 24316 event pairs, 103 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 3906. Up to 347 conditions per place. [2024-11-28 05:14:02,474 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 65 selfloop transitions, 15 changer transitions 0/594 dead transitions. [2024-11-28 05:14:02,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 594 transitions, 1507 flow [2024-11-28 05:14:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:14:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:14:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6290 transitions. [2024-11-28 05:14:02,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062094799020314 [2024-11-28 05:14:02,484 INFO L175 Difference]: Start difference. First operand has 574 places, 565 transitions, 1273 flow. Second operand 11 states and 6290 transitions. [2024-11-28 05:14:02,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 594 transitions, 1507 flow [2024-11-28 05:14:02,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1507 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:14:02,497 INFO L231 Difference]: Finished difference. Result has 589 places, 573 transitions, 1349 flow [2024-11-28 05:14:02,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1349, PETRI_PLACES=589, PETRI_TRANSITIONS=573} [2024-11-28 05:14:02,498 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 2 predicate places. [2024-11-28 05:14:02,498 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 573 transitions, 1349 flow [2024-11-28 05:14:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:02,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:02,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:14:02,501 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:02,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash -547717862, now seen corresponding path program 1 times [2024-11-28 05:14:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:02,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916692395] [2024-11-28 05:14:02,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:14:02,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916692395] [2024-11-28 05:14:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916692395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:14:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967191012] [2024-11-28 05:14:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:02,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:14:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:02,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:14:02,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:14:03,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-28 05:14:03,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 573 transitions, 1349 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:03,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:03,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-28 05:14:03,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:04,315 INFO L124 PetriNetUnfolderBase]: 147/2380 cut-off events. [2024-11-28 05:14:04,315 INFO L125 PetriNetUnfolderBase]: For 118/172 co-relation queries the response was YES. [2024-11-28 05:14:04,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 2380 events. 147/2380 cut-off events. For 118/172 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 15127 event pairs, 55 based on Foata normal form. 2/2219 useless extension candidates. Maximal degree in co-relation 3157. Up to 233 conditions per place. [2024-11-28 05:14:04,340 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 71 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2024-11-28 05:14:04,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1627 flow [2024-11-28 05:14:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:14:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:14:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6292 transitions. [2024-11-28 05:14:04,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064976228209192 [2024-11-28 05:14:04,353 INFO L175 Difference]: Start difference. First operand has 589 places, 573 transitions, 1349 flow. Second operand 11 states and 6292 transitions. [2024-11-28 05:14:04,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1627 flow [2024-11-28 05:14:04,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 603 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:14:04,367 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1440 flow [2024-11-28 05:14:04,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1440, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2024-11-28 05:14:04,368 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2024-11-28 05:14:04,369 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1440 flow [2024-11-28 05:14:04,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:04,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:04,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:04,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:14:04,371 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1003378698, now seen corresponding path program 1 times [2024-11-28 05:14:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216738035] [2024-11-28 05:14:04,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:14:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216738035] [2024-11-28 05:14:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216738035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:04,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:04,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:14:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440775823] [2024-11-28 05:14:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:04,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:14:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:04,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:14:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:14:05,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-28 05:14:05,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:05,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:05,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-28 05:14:05,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:07,215 INFO L124 PetriNetUnfolderBase]: 338/4947 cut-off events. [2024-11-28 05:14:07,215 INFO L125 PetriNetUnfolderBase]: For 466/624 co-relation queries the response was YES. [2024-11-28 05:14:07,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 4947 events. 338/4947 cut-off events. For 466/624 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42937 event pairs, 127 based on Foata normal form. 4/4536 useless extension candidates. Maximal degree in co-relation 6594. Up to 348 conditions per place. [2024-11-28 05:14:07,288 INFO L140 encePairwiseOnDemand]: 615/631 looper letters, 65 selfloop transitions, 22 changer transitions 0/607 dead transitions. [2024-11-28 05:14:07,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 607 transitions, 1712 flow [2024-11-28 05:14:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:14:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 05:14:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6851 transitions. [2024-11-28 05:14:07,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047807712625462 [2024-11-28 05:14:07,297 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1440 flow. Second operand 12 states and 6851 transitions. [2024-11-28 05:14:07,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 607 transitions, 1712 flow [2024-11-28 05:14:07,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 607 transitions, 1691 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 05:14:07,315 INFO L231 Difference]: Finished difference. Result has 611 places, 591 transitions, 1551 flow [2024-11-28 05:14:07,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1551, PETRI_PLACES=611, PETRI_TRANSITIONS=591} [2024-11-28 05:14:07,317 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 24 predicate places. [2024-11-28 05:14:07,317 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 591 transitions, 1551 flow [2024-11-28 05:14:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:07,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:07,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:07,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:14:07,319 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:07,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 994323625, now seen corresponding path program 1 times [2024-11-28 05:14:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746837127] [2024-11-28 05:14:07,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:14:07,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:07,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746837127] [2024-11-28 05:14:07,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746837127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:14:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006614428] [2024-11-28 05:14:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:07,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:14:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:07,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:14:07,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:14:08,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-28 05:14:08,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 591 transitions, 1551 flow. Second operand has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:08,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:08,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-28 05:14:08,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:09,916 INFO L124 PetriNetUnfolderBase]: 296/3577 cut-off events. [2024-11-28 05:14:09,916 INFO L125 PetriNetUnfolderBase]: For 649/708 co-relation queries the response was YES. [2024-11-28 05:14:09,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5124 conditions, 3577 events. 296/3577 cut-off events. For 649/708 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28732 event pairs, 153 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 5035. Up to 433 conditions per place. [2024-11-28 05:14:09,964 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 67 selfloop transitions, 18 changer transitions 0/612 dead transitions. [2024-11-28 05:14:09,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 612 transitions, 1803 flow [2024-11-28 05:14:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:14:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:14:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2024-11-28 05:14:09,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052009796859242 [2024-11-28 05:14:09,973 INFO L175 Difference]: Start difference. First operand has 611 places, 591 transitions, 1551 flow. Second operand 11 states and 6283 transitions. [2024-11-28 05:14:09,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 612 transitions, 1803 flow [2024-11-28 05:14:09,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 612 transitions, 1803 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:14:09,986 INFO L231 Difference]: Finished difference. Result has 624 places, 597 transitions, 1646 flow [2024-11-28 05:14:09,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1646, PETRI_PLACES=624, PETRI_TRANSITIONS=597} [2024-11-28 05:14:09,987 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 37 predicate places. [2024-11-28 05:14:09,987 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 597 transitions, 1646 flow [2024-11-28 05:14:09,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:09,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:09,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:09,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:14:09,989 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:09,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash 640039820, now seen corresponding path program 1 times [2024-11-28 05:14:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020686071] [2024-11-28 05:14:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020686071] [2024-11-28 05:14:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020686071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:11,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:11,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765782962] [2024-11-28 05:14:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:11,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:11,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:11,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:12,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-28 05:14:12,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 597 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:12,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:12,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-28 05:14:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:13,427 INFO L124 PetriNetUnfolderBase]: 157/3538 cut-off events. [2024-11-28 05:14:13,427 INFO L125 PetriNetUnfolderBase]: For 602/646 co-relation queries the response was YES. [2024-11-28 05:14:13,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5025 conditions, 3538 events. 157/3538 cut-off events. For 602/646 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 25897 event pairs, 22 based on Foata normal form. 12/3338 useless extension candidates. Maximal degree in co-relation 4930. Up to 173 conditions per place. [2024-11-28 05:14:13,474 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 41 selfloop transitions, 5 changer transitions 0/606 dead transitions. [2024-11-28 05:14:13,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 606 transitions, 1767 flow [2024-11-28 05:14:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:14:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2024-11-28 05:14:13,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247226624405706 [2024-11-28 05:14:13,479 INFO L175 Difference]: Start difference. First operand has 624 places, 597 transitions, 1646 flow. Second operand 6 states and 3501 transitions. [2024-11-28 05:14:13,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 606 transitions, 1767 flow [2024-11-28 05:14:13,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 606 transitions, 1746 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 05:14:13,494 INFO L231 Difference]: Finished difference. Result has 620 places, 595 transitions, 1631 flow [2024-11-28 05:14:13,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1631, PETRI_PLACES=620, PETRI_TRANSITIONS=595} [2024-11-28 05:14:13,496 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 33 predicate places. [2024-11-28 05:14:13,496 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 595 transitions, 1631 flow [2024-11-28 05:14:13,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:13,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:13,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:14:13,497 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1474380489, now seen corresponding path program 1 times [2024-11-28 05:14:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669467976] [2024-11-28 05:14:13,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669467976] [2024-11-28 05:14:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669467976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338141137] [2024-11-28 05:14:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:14,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:14,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:15,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-28 05:14:15,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 595 transitions, 1631 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:15,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:15,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-28 05:14:15,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:16,460 INFO L124 PetriNetUnfolderBase]: 186/3895 cut-off events. [2024-11-28 05:14:16,460 INFO L125 PetriNetUnfolderBase]: For 728/826 co-relation queries the response was YES. [2024-11-28 05:14:16,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3895 events. 186/3895 cut-off events. For 728/826 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30206 event pairs, 30 based on Foata normal form. 8/3651 useless extension candidates. Maximal degree in co-relation 5408. Up to 197 conditions per place. [2024-11-28 05:14:16,517 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 40 selfloop transitions, 5 changer transitions 0/603 dead transitions. [2024-11-28 05:14:16,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 603 transitions, 1747 flow [2024-11-28 05:14:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:14:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2024-11-28 05:14:16,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244585314315901 [2024-11-28 05:14:16,521 INFO L175 Difference]: Start difference. First operand has 620 places, 595 transitions, 1631 flow. Second operand 6 states and 3500 transitions. [2024-11-28 05:14:16,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 603 transitions, 1747 flow [2024-11-28 05:14:16,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 603 transitions, 1737 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:14:16,533 INFO L231 Difference]: Finished difference. Result has 618 places, 593 transitions, 1627 flow [2024-11-28 05:14:16,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1627, PETRI_PLACES=618, PETRI_TRANSITIONS=593} [2024-11-28 05:14:16,534 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 31 predicate places. [2024-11-28 05:14:16,534 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 593 transitions, 1627 flow [2024-11-28 05:14:16,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:16,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:16,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:14:16,536 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -370033998, now seen corresponding path program 1 times [2024-11-28 05:14:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991407833] [2024-11-28 05:14:16,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:17,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:17,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991407833] [2024-11-28 05:14:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991407833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:17,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135723582] [2024-11-28 05:14:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:17,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:17,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:18,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-28 05:14:18,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 593 transitions, 1627 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:18,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:18,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-28 05:14:18,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:19,065 INFO L124 PetriNetUnfolderBase]: 134/3605 cut-off events. [2024-11-28 05:14:19,065 INFO L125 PetriNetUnfolderBase]: For 575/648 co-relation queries the response was YES. [2024-11-28 05:14:19,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 3605 events. 134/3605 cut-off events. For 575/648 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 26225 event pairs, 22 based on Foata normal form. 11/3409 useless extension candidates. Maximal degree in co-relation 4934. Up to 183 conditions per place. [2024-11-28 05:14:19,105 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 41 selfloop transitions, 5 changer transitions 0/602 dead transitions. [2024-11-28 05:14:19,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 602 transitions, 1748 flow [2024-11-28 05:14:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:14:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2024-11-28 05:14:19,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247226624405706 [2024-11-28 05:14:19,109 INFO L175 Difference]: Start difference. First operand has 618 places, 593 transitions, 1627 flow. Second operand 6 states and 3501 transitions. [2024-11-28 05:14:19,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 602 transitions, 1748 flow [2024-11-28 05:14:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 602 transitions, 1738 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:14:19,128 INFO L231 Difference]: Finished difference. Result has 616 places, 591 transitions, 1623 flow [2024-11-28 05:14:19,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1623, PETRI_PLACES=616, PETRI_TRANSITIONS=591} [2024-11-28 05:14:19,129 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 29 predicate places. [2024-11-28 05:14:19,130 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 591 transitions, 1623 flow [2024-11-28 05:14:19,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:19,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:19,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:19,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:14:19,131 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash 459608505, now seen corresponding path program 1 times [2024-11-28 05:14:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173018830] [2024-11-28 05:14:19,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:19,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:19,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173018830] [2024-11-28 05:14:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173018830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:19,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:19,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502591113] [2024-11-28 05:14:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:19,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:19,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:19,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:19,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-28 05:14:19,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 591 transitions, 1623 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:19,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:19,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-28 05:14:19,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:20,885 INFO L124 PetriNetUnfolderBase]: 411/6715 cut-off events. [2024-11-28 05:14:20,885 INFO L125 PetriNetUnfolderBase]: For 576/604 co-relation queries the response was YES. [2024-11-28 05:14:20,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8497 conditions, 6715 events. 411/6715 cut-off events. For 576/604 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 61556 event pairs, 63 based on Foata normal form. 0/6202 useless extension candidates. Maximal degree in co-relation 8404. Up to 469 conditions per place. [2024-11-28 05:14:20,974 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 19 selfloop transitions, 2 changer transitions 0/593 dead transitions. [2024-11-28 05:14:20,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 593 transitions, 1673 flow [2024-11-28 05:14:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-28 05:14:20,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498151082937136 [2024-11-28 05:14:20,976 INFO L175 Difference]: Start difference. First operand has 616 places, 591 transitions, 1623 flow. Second operand 3 states and 1798 transitions. [2024-11-28 05:14:20,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 593 transitions, 1673 flow [2024-11-28 05:14:20,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 593 transitions, 1663 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:14:20,989 INFO L231 Difference]: Finished difference. Result has 610 places, 589 transitions, 1619 flow [2024-11-28 05:14:20,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1619, PETRI_PLACES=610, PETRI_TRANSITIONS=589} [2024-11-28 05:14:20,990 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 23 predicate places. [2024-11-28 05:14:20,990 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 589 transitions, 1619 flow [2024-11-28 05:14:20,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:20,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:20,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:20,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 05:14:20,991 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:20,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1049214112, now seen corresponding path program 1 times [2024-11-28 05:14:20,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:20,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27734406] [2024-11-28 05:14:20,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:20,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27734406] [2024-11-28 05:14:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27734406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:21,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:21,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:21,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884439674] [2024-11-28 05:14:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:21,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:21,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:21,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:22,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-28 05:14:22,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 589 transitions, 1619 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:22,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:22,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-28 05:14:22,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:23,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][478], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 317#L104true, Black: 720#true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 845#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 296#L79-3true, Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|)]) [2024-11-28 05:14:23,468 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-28 05:14:23,468 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-28 05:14:23,469 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-28 05:14:23,469 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-28 05:14:23,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][483], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#true, 317#L104true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(<= ~n3~0 0), 772#true, 846#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|), 207#L79-4true]) [2024-11-28 05:14:23,483 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-28 05:14:23,483 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-28 05:14:23,483 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-28 05:14:23,483 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-28 05:14:23,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][490], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 317#L104true, Black: 720#true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|), 169#L79-5true]) [2024-11-28 05:14:23,491 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-28 05:14:23,491 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-28 05:14:23,492 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-28 05:14:23,492 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-28 05:14:23,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][495], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), 153#L79-6true, Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 317#L104true, Black: 720#true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 848#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|)]) [2024-11-28 05:14:23,498 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-28 05:14:23,498 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-28 05:14:23,498 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-28 05:14:23,498 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 05:14:23,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][495], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 317#L104true, Black: 720#true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 128#L79-7true, Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 848#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|)]) [2024-11-28 05:14:23,507 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-28 05:14:23,507 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-28 05:14:23,507 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-28 05:14:23,507 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-28 05:14:23,618 INFO L124 PetriNetUnfolderBase]: 260/4215 cut-off events. [2024-11-28 05:14:23,619 INFO L125 PetriNetUnfolderBase]: For 802/846 co-relation queries the response was YES. [2024-11-28 05:14:23,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 4215 events. 260/4215 cut-off events. For 802/846 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 34337 event pairs, 32 based on Foata normal form. 8/4017 useless extension candidates. Maximal degree in co-relation 5841. Up to 200 conditions per place. [2024-11-28 05:14:23,668 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 39 selfloop transitions, 5 changer transitions 0/596 dead transitions. [2024-11-28 05:14:23,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 596 transitions, 1730 flow [2024-11-28 05:14:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:14:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-28 05:14:23,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241944004226096 [2024-11-28 05:14:23,672 INFO L175 Difference]: Start difference. First operand has 610 places, 589 transitions, 1619 flow. Second operand 6 states and 3499 transitions. [2024-11-28 05:14:23,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 596 transitions, 1730 flow [2024-11-28 05:14:23,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 596 transitions, 1730 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:14:23,682 INFO L231 Difference]: Finished difference. Result has 613 places, 587 transitions, 1625 flow [2024-11-28 05:14:23,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1625, PETRI_PLACES=613, PETRI_TRANSITIONS=587} [2024-11-28 05:14:23,684 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 26 predicate places. [2024-11-28 05:14:23,684 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 587 transitions, 1625 flow [2024-11-28 05:14:23,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:23,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:23,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:23,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:14:23,685 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1309996323, now seen corresponding path program 1 times [2024-11-28 05:14:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500299566] [2024-11-28 05:14:23,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:24,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:24,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500299566] [2024-11-28 05:14:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500299566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542279198] [2024-11-28 05:14:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:24,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:24,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:25,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-28 05:14:25,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 587 transitions, 1625 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:25,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:25,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-28 05:14:25,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:26,270 INFO L124 PetriNetUnfolderBase]: 195/4259 cut-off events. [2024-11-28 05:14:26,270 INFO L125 PetriNetUnfolderBase]: For 712/804 co-relation queries the response was YES. [2024-11-28 05:14:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 4259 events. 195/4259 cut-off events. For 712/804 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 33502 event pairs, 29 based on Foata normal form. 7/4060 useless extension candidates. Maximal degree in co-relation 5879. Up to 196 conditions per place. [2024-11-28 05:14:26,324 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 40 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2024-11-28 05:14:26,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 595 transitions, 1741 flow [2024-11-28 05:14:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:14:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2024-11-28 05:14:26,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244585314315901 [2024-11-28 05:14:26,328 INFO L175 Difference]: Start difference. First operand has 613 places, 587 transitions, 1625 flow. Second operand 6 states and 3500 transitions. [2024-11-28 05:14:26,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 595 transitions, 1741 flow [2024-11-28 05:14:26,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 595 transitions, 1731 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:14:26,340 INFO L231 Difference]: Finished difference. Result has 611 places, 585 transitions, 1621 flow [2024-11-28 05:14:26,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1621, PETRI_PLACES=611, PETRI_TRANSITIONS=585} [2024-11-28 05:14:26,341 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 24 predicate places. [2024-11-28 05:14:26,341 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 585 transitions, 1621 flow [2024-11-28 05:14:26,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:26,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:26,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:26,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:14:26,342 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 244138693, now seen corresponding path program 1 times [2024-11-28 05:14:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795772404] [2024-11-28 05:14:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795772404] [2024-11-28 05:14:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795772404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074962345] [2024-11-28 05:14:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:26,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:26,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:26,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:26,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 631 [2024-11-28 05:14:26,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 585 transitions, 1621 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:26,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:26,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 631 [2024-11-28 05:14:26,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:27,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1753] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), 459#L105true, Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#true, 634#(= |#race~n2~0| 0), Black: 658#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 660#(= |#race~a1~0| 0), 849#true, Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 855#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|)]) [2024-11-28 05:14:27,372 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-28 05:14:27,372 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 05:14:27,372 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-28 05:14:27,373 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 05:14:27,476 INFO L124 PetriNetUnfolderBase]: 130/4207 cut-off events. [2024-11-28 05:14:27,476 INFO L125 PetriNetUnfolderBase]: For 566/592 co-relation queries the response was YES. [2024-11-28 05:14:27,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 4207 events. 130/4207 cut-off events. For 566/592 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 31543 event pairs, 22 based on Foata normal form. 0/4036 useless extension candidates. Maximal degree in co-relation 5562. Up to 124 conditions per place. [2024-11-28 05:14:27,528 INFO L140 encePairwiseOnDemand]: 629/631 looper letters, 9 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2024-11-28 05:14:27,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 584 transitions, 1639 flow [2024-11-28 05:14:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2024-11-28 05:14:27,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550977284733227 [2024-11-28 05:14:27,530 INFO L175 Difference]: Start difference. First operand has 611 places, 585 transitions, 1621 flow. Second operand 3 states and 1808 transitions. [2024-11-28 05:14:27,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 584 transitions, 1639 flow [2024-11-28 05:14:27,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 584 transitions, 1629 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:14:27,549 INFO L231 Difference]: Finished difference. Result has 607 places, 584 transitions, 1611 flow [2024-11-28 05:14:27,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1611, PETRI_PLACES=607, PETRI_TRANSITIONS=584} [2024-11-28 05:14:27,550 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 20 predicate places. [2024-11-28 05:14:27,550 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 584 transitions, 1611 flow [2024-11-28 05:14:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:27,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:27,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:14:27,551 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1901345478, now seen corresponding path program 1 times [2024-11-28 05:14:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356010033] [2024-11-28 05:14:27,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356010033] [2024-11-28 05:14:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356010033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:14:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477360040] [2024-11-28 05:14:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:14:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:28,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:14:28,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:29,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-28 05:14:29,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 584 transitions, 1611 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:29,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:29,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-28 05:14:29,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:30,120 INFO L124 PetriNetUnfolderBase]: 220/4123 cut-off events. [2024-11-28 05:14:30,120 INFO L125 PetriNetUnfolderBase]: For 762/791 co-relation queries the response was YES. [2024-11-28 05:14:30,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 4123 events. 220/4123 cut-off events. For 762/791 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 32552 event pairs, 32 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 5686. Up to 204 conditions per place. [2024-11-28 05:14:30,168 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 39 selfloop transitions, 5 changer transitions 0/591 dead transitions. [2024-11-28 05:14:30,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 591 transitions, 1722 flow [2024-11-28 05:14:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:14:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:14:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-28 05:14:30,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241944004226096 [2024-11-28 05:14:30,172 INFO L175 Difference]: Start difference. First operand has 607 places, 584 transitions, 1611 flow. Second operand 6 states and 3499 transitions. [2024-11-28 05:14:30,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 591 transitions, 1722 flow [2024-11-28 05:14:30,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 591 transitions, 1721 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:14:30,190 INFO L231 Difference]: Finished difference. Result has 609 places, 582 transitions, 1616 flow [2024-11-28 05:14:30,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1616, PETRI_PLACES=609, PETRI_TRANSITIONS=582} [2024-11-28 05:14:30,191 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2024-11-28 05:14:30,191 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 582 transitions, 1616 flow [2024-11-28 05:14:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:30,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:30,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:30,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 05:14:30,193 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:30,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2113234072, now seen corresponding path program 1 times [2024-11-28 05:14:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779958305] [2024-11-28 05:14:30,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:30,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:30,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779958305] [2024-11-28 05:14:30,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779958305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:30,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:30,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682532847] [2024-11-28 05:14:30,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:30,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:30,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:30,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:30,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:30,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:14:30,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 582 transitions, 1616 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:30,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:30,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:14:30,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:31,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1753] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), 459#L105true, Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#true, 634#(= |#race~n2~0| 0), Black: 658#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 640#(= |#race~n3~0| 0), 841#(= |#race~a3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|), 858#true]) [2024-11-28 05:14:31,128 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-28 05:14:31,129 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-28 05:14:31,129 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 05:14:31,129 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 05:14:31,237 INFO L124 PetriNetUnfolderBase]: 120/3723 cut-off events. [2024-11-28 05:14:31,237 INFO L125 PetriNetUnfolderBase]: For 461/527 co-relation queries the response was YES. [2024-11-28 05:14:31,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 3723 events. 120/3723 cut-off events. For 461/527 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26317 event pairs, 27 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 4968. Up to 133 conditions per place. [2024-11-28 05:14:31,284 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 11 selfloop transitions, 1 changer transitions 0/580 dead transitions. [2024-11-28 05:14:31,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 580 transitions, 1636 flow [2024-11-28 05:14:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2024-11-28 05:14:31,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519281563655573 [2024-11-28 05:14:31,286 INFO L175 Difference]: Start difference. First operand has 609 places, 582 transitions, 1616 flow. Second operand 3 states and 1802 transitions. [2024-11-28 05:14:31,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 580 transitions, 1636 flow [2024-11-28 05:14:31,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 580 transitions, 1626 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:14:31,297 INFO L231 Difference]: Finished difference. Result has 604 places, 580 transitions, 1604 flow [2024-11-28 05:14:31,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1604, PETRI_PLACES=604, PETRI_TRANSITIONS=580} [2024-11-28 05:14:31,298 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 17 predicate places. [2024-11-28 05:14:31,298 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 580 transitions, 1604 flow [2024-11-28 05:14:31,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:31,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:31,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:31,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 05:14:31,299 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:31,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1836375443, now seen corresponding path program 1 times [2024-11-28 05:14:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493599930] [2024-11-28 05:14:31,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:31,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:31,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493599930] [2024-11-28 05:14:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493599930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:31,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:31,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752881875] [2024-11-28 05:14:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:31,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:31,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:31,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:31,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:14:31,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 580 transitions, 1604 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:31,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:31,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:14:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:32,081 INFO L124 PetriNetUnfolderBase]: 120/3068 cut-off events. [2024-11-28 05:14:32,081 INFO L125 PetriNetUnfolderBase]: For 369/409 co-relation queries the response was YES. [2024-11-28 05:14:32,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4143 conditions, 3068 events. 120/3068 cut-off events. For 369/409 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 20748 event pairs, 33 based on Foata normal form. 15/3009 useless extension candidates. Maximal degree in co-relation 4049. Up to 144 conditions per place. [2024-11-28 05:14:32,116 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 7 selfloop transitions, 0 changer transitions 24/578 dead transitions. [2024-11-28 05:14:32,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 578 transitions, 1622 flow [2024-11-28 05:14:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-28 05:14:32,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-28 05:14:32,119 INFO L175 Difference]: Start difference. First operand has 604 places, 580 transitions, 1604 flow. Second operand 3 states and 1801 transitions. [2024-11-28 05:14:32,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 578 transitions, 1622 flow [2024-11-28 05:14:32,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 578 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:14:32,134 INFO L231 Difference]: Finished difference. Result has 603 places, 554 transitions, 1494 flow [2024-11-28 05:14:32,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=603, PETRI_TRANSITIONS=554} [2024-11-28 05:14:32,135 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 16 predicate places. [2024-11-28 05:14:32,135 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 554 transitions, 1494 flow [2024-11-28 05:14:32,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:32,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:32,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:32,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 05:14:32,136 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1861373655, now seen corresponding path program 1 times [2024-11-28 05:14:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794899774] [2024-11-28 05:14:32,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:14:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794899774] [2024-11-28 05:14:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794899774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:32,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530487158] [2024-11-28 05:14:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:32,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:32,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:32,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:32,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 631 [2024-11-28 05:14:32,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 554 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:32,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:32,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 631 [2024-11-28 05:14:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:33,058 INFO L124 PetriNetUnfolderBase]: 140/3562 cut-off events. [2024-11-28 05:14:33,059 INFO L125 PetriNetUnfolderBase]: For 379/389 co-relation queries the response was YES. [2024-11-28 05:14:33,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4760 conditions, 3562 events. 140/3562 cut-off events. For 379/389 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 23862 event pairs, 20 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4726. Up to 93 conditions per place. [2024-11-28 05:14:33,102 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 10 selfloop transitions, 2 changer transitions 13/555 dead transitions. [2024-11-28 05:14:33,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 555 transitions, 1522 flow [2024-11-28 05:14:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-28 05:14:33,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-28 05:14:33,104 INFO L175 Difference]: Start difference. First operand has 603 places, 554 transitions, 1494 flow. Second operand 3 states and 1804 transitions. [2024-11-28 05:14:33,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 555 transitions, 1522 flow [2024-11-28 05:14:33,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 555 transitions, 1512 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-28 05:14:33,121 INFO L231 Difference]: Finished difference. Result has 583 places, 540 transitions, 1398 flow [2024-11-28 05:14:33,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=583, PETRI_TRANSITIONS=540} [2024-11-28 05:14:33,123 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -4 predicate places. [2024-11-28 05:14:33,123 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 540 transitions, 1398 flow [2024-11-28 05:14:33,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:33,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:33,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:33,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 05:14:33,124 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1847280449, now seen corresponding path program 1 times [2024-11-28 05:14:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658258906] [2024-11-28 05:14:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658258906] [2024-11-28 05:14:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658258906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333368801] [2024-11-28 05:14:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:33,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:33,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:33,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:33,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:14:33,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 540 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:33,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:33,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:14:33,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:34,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1441] L51-7-->L51-8: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][373], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 370#L65true, 722#(= |#race~a2~0| 0), Black: 839#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 702#(<= ~n1~0 0), 473#L51-8true, Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 51#L102-4true, Black: 720#true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 841#(= |#race~a3~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 136#L79true, Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 803#(<= ~n3~0 0), 867#true, 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|), 873#true, 870#true]) [2024-11-28 05:14:34,141 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-28 05:14:34,141 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-28 05:14:34,141 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-28 05:14:34,142 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-28 05:14:34,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][352], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 722#(= |#race~a2~0| 0), 622#(= |#race~n1~0| 0), Black: 839#true, Black: 716#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 702#(<= ~n1~0 0), Black: 703#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 317#L104true, Black: 720#true, 634#(= |#race~n2~0| 0), Black: 658#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 841#(= |#race~a3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 136#L79true, Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 803#(<= ~n3~0 0), 867#true, 772#true, Black: 694#(not |thread3Thread1of1ForFork0_#t~short20#1|), 873#true, 870#true]) [2024-11-28 05:14:34,212 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-28 05:14:34,212 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-28 05:14:34,212 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-28 05:14:34,212 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-28 05:14:34,222 INFO L124 PetriNetUnfolderBase]: 135/2905 cut-off events. [2024-11-28 05:14:34,223 INFO L125 PetriNetUnfolderBase]: For 226/249 co-relation queries the response was YES. [2024-11-28 05:14:34,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3779 conditions, 2905 events. 135/2905 cut-off events. For 226/249 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18425 event pairs, 27 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3744. Up to 90 conditions per place. [2024-11-28 05:14:34,263 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 10 selfloop transitions, 2 changer transitions 11/541 dead transitions. [2024-11-28 05:14:34,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 541 transitions, 1426 flow [2024-11-28 05:14:34,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-28 05:14:34,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-28 05:14:34,265 INFO L175 Difference]: Start difference. First operand has 583 places, 540 transitions, 1398 flow. Second operand 3 states and 1801 transitions. [2024-11-28 05:14:34,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 541 transitions, 1426 flow [2024-11-28 05:14:34,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 541 transitions, 1372 flow, removed 11 selfloop flow, removed 15 redundant places. [2024-11-28 05:14:34,274 INFO L231 Difference]: Finished difference. Result has 562 places, 528 transitions, 1274 flow [2024-11-28 05:14:34,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=562, PETRI_TRANSITIONS=528} [2024-11-28 05:14:34,275 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -25 predicate places. [2024-11-28 05:14:34,275 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 528 transitions, 1274 flow [2024-11-28 05:14:34,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:34,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:14:34,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:34,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 05:14:34,276 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-28 05:14:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1356908457, now seen corresponding path program 1 times [2024-11-28 05:14:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556331578] [2024-11-28 05:14:34,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:14:34,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:34,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556331578] [2024-11-28 05:14:34,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556331578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:34,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:34,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:34,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978148704] [2024-11-28 05:14:34,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:34,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:34,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:34,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:34,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:34,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-28 05:14:34,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 528 transitions, 1274 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:34,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:14:34,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-28 05:14:34,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:14:34,810 INFO L124 PetriNetUnfolderBase]: 107/1753 cut-off events. [2024-11-28 05:14:34,810 INFO L125 PetriNetUnfolderBase]: For 84/106 co-relation queries the response was YES. [2024-11-28 05:14:34,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1753 events. 107/1753 cut-off events. For 84/106 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9560 event pairs, 21 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 2188. Up to 71 conditions per place. [2024-11-28 05:14:34,828 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 0 selfloop transitions, 0 changer transitions 529/529 dead transitions. [2024-11-28 05:14:34,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 529 transitions, 1302 flow [2024-11-28 05:14:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:14:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-28 05:14:34,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-28 05:14:34,830 INFO L175 Difference]: Start difference. First operand has 562 places, 528 transitions, 1274 flow. Second operand 3 states and 1801 transitions. [2024-11-28 05:14:34,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 529 transitions, 1302 flow [2024-11-28 05:14:34,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 529 transitions, 1260 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-28 05:14:34,836 INFO L231 Difference]: Finished difference. Result has 543 places, 0 transitions, 0 flow [2024-11-28 05:14:34,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=543, PETRI_TRANSITIONS=0} [2024-11-28 05:14:34,837 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -44 predicate places. [2024-11-28 05:14:34,837 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 0 transitions, 0 flow [2024-11-28 05:14:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:14:34,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2024-11-28 05:14:34,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2024-11-28 05:14:34,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2024-11-28 05:14:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2024-11-28 05:14:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2024-11-28 05:14:34,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2024-11-28 05:14:34,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2024-11-28 05:14:34,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2024-11-28 05:14:34,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2024-11-28 05:14:34,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 05:14:34,848 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:34,856 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:14:34,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:14:34,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:14:34 BasicIcfg [2024-11-28 05:14:34,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:14:34,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:14:34,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:14:34,869 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:14:34,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:13:25" (3/4) ... [2024-11-28 05:14:34,872 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 05:14:34,876 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 05:14:34,877 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 05:14:34,877 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-28 05:14:34,885 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-28 05:14:34,886 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 05:14:34,886 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 05:14:34,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 05:14:35,032 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 05:14:35,033 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 05:14:35,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:14:35,034 INFO L158 Benchmark]: Toolchain (without parser) took 72305.70ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 100.7MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-28 05:14:35,035 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:14:35,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.18ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 86.9MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:14:35,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.97ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 83.1MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:14:35,037 INFO L158 Benchmark]: Boogie Preprocessor took 105.84ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 79.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:14:35,038 INFO L158 Benchmark]: RCFGBuilder took 1777.35ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 35.1MB in the end (delta: 44.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-28 05:14:35,039 INFO L158 Benchmark]: TraceAbstraction took 69654.50ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 34.4MB in the beginning and 4.9GB in the end (delta: -4.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-28 05:14:35,039 INFO L158 Benchmark]: Witness Printer took 165.18ms. Allocated memory is still 7.3GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:14:35,043 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.42ms. Allocated memory is still 167.8MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.18ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 86.9MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.97ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 83.1MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.84ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 79.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1777.35ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 35.1MB in the end (delta: 44.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 69654.50ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 34.4MB in the beginning and 4.9GB in the end (delta: -4.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 165.18ms. Allocated memory is still 7.3GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 932 locations, 104 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: 69.1s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 57.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6707 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4288 mSDsluCounter, 6688 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6272 mSDsCounter, 1298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10536 IncrementalHoareTripleChecker+Invalid, 11834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1298 mSolverCounterUnsat, 416 mSDtfsCounter, 10536 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1646occurred in iteration=24, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 6303 NumberOfCodeBlocks, 6303 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6266 ConstructedInterpolants, 0 QuantifiedInterpolants, 8594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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 - AllSpecificationsHoldResult: All specifications hold 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 05:14:35,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7815859-e6a1-48a1-a628-e266c6665158/bin/uautomizer-verify-aQ6SnzHsRB/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 Result: TRUE