./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:23,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:23,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:40:23,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:23,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:23,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:23,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:23,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:23,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:23,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:23,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:23,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:23,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:23,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:23,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:23,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:23,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:23,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:23,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:23,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:23,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:23,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:23,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:23,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:23,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:23,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:23,469 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2025-02-08 05:40:23,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:23,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:23,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:23,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:23,693 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:23,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-02-08 05:40:24,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/518022b78/30aeaeb69d0a4b8799b2574e855fffd4/FLAG901e9c710 [2025-02-08 05:40:25,044 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:25,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-02-08 05:40:25,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/518022b78/30aeaeb69d0a4b8799b2574e855fffd4/FLAG901e9c710 [2025-02-08 05:40:25,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/518022b78/30aeaeb69d0a4b8799b2574e855fffd4 [2025-02-08 05:40:25,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:25,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:25,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:25,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:25,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:25,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3afc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25, skipping insertion in model container [2025-02-08 05:40:25,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:25,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:25,559 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:25,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:25,598 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:25,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25 WrapperNode [2025-02-08 05:40:25,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:25,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:25,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:25,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:25,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,639 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 627 [2025-02-08 05:40:25,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:25,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:25,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:25,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:25,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:25,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:25,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:25,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:25,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (1/1) ... [2025-02-08 05:40:25,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:25,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:25,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:40:25,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:40:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:40:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:25,726 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:40:25,830 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:25,831 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:26,243 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc #t~nondet21#1; [2025-02-08 05:40:26,243 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: havoc #t~ret20#1; [2025-02-08 05:40:26,243 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: assume #race~total~0 == #t~nondet21#1; [2025-02-08 05:40:26,243 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: assume !(#race~total~0 == #t~nondet21#1); [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-3: havoc #t~mem19#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-4: #race~total~0 := #t~nondet21#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-5: havoc #t~nondet21#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-6: ~total~0 := #t~ret20#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-10: #t~ret20#1 := plus_#res#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc #t~nondet23#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-1: assume #race~q1_front~0 == #t~nondet23#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-1: assume !(#race~q1_front~0 == #t~nondet23#1); [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-2: havoc #t~post22#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-3: #race~q1_front~0 := #t~nondet23#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-4: havoc #t~nondet23#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-5: ~q1_front~0 := 1 + #t~post22#1; [2025-02-08 05:40:26,244 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: assume 0 == #race~q1_front~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-7: #t~post22#1 := ~q1_front~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-8: #race~q1_front~0 := 0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: #race~i~0 := 0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc #t~short24#1; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-1: ~cond~2#1 := (if 0 == (if #t~short24#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-2: assume 0 == #race~q1_back~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-2: assume !(0 == #race~q1_back~0); [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-3: #t~short24#1 := ~q1_front~0 < ~q1_back~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-4: assume 0 == #race~q1_front~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-4: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-5: #race~q1_back~0 := 0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-6: assume #t~short24#1; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-6: assume !#t~short24#1; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-7: #race~q1_front~0 := 0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-8: assume 0 == #race~N~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-8: assume !(0 == #race~N~0); [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-9: #t~short24#1 := ~i~0 < ~N~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-10: assume 0 == #race~i~0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-10: assume !(0 == #race~i~0); [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-11: #race~N~0 := 0; [2025-02-08 05:40:26,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: [2025-02-08 05:40:26,612 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: [2025-02-08 05:40:26,612 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc #t~nondet30#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: havoc #t~ret29#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: assume #race~total~0 == #t~nondet30#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: assume !(#race~total~0 == #t~nondet30#1); [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-3: havoc #t~mem28#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-4: #race~total~0 := #t~nondet30#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-5: havoc #t~nondet30#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-6: ~total~0 := #t~ret29#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-10: #t~ret29#1 := plus_#res#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc #t~nondet32#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: assume #race~q2_front~0 == #t~nondet32#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: assume !(#race~q2_front~0 == #t~nondet32#1); [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc #t~post31#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: #race~q2_front~0 := #t~nondet32#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: havoc #t~nondet32#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-5: ~q2_front~0 := 1 + #t~post31#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-6: assume 0 == #race~q2_front~0; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-6: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-7: #t~post31#1 := ~q2_front~0; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-8: #race~q2_front~0 := 0; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: #race~j~0 := 0; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc #t~short33#1; [2025-02-08 05:40:26,613 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-1: ~cond~3#1 := (if 0 == (if #t~short33#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-2: assume 0 == #race~q2_back~0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-2: assume !(0 == #race~q2_back~0); [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-3: #t~short33#1 := ~q2_front~0 < ~q2_back~0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-4: assume 0 == #race~q2_front~0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-4: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-5: #race~q2_back~0 := 0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-6: assume #t~short33#1; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-6: assume !#t~short33#1; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-7: #race~q2_front~0 := 0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-8: assume 0 == #race~N~0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-8: assume !(0 == #race~N~0); [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-9: #t~short33#1 := ~j~0 < ~N~0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-10: assume 0 == #race~j~0; [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-10: assume !(0 == #race~j~0); [2025-02-08 05:40:26,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-11: #race~N~0 := 0; [2025-02-08 05:40:26,615 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:26,615 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:26,941 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L170 is not an error location. [2025-02-08 05:40:26,943 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L170 is not an error location. [2025-02-08 05:40:26,943 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:26,943 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:26,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:26 BoogieIcfgContainer [2025-02-08 05:40:26,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:26,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:26,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:26,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:26,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:25" (1/3) ... [2025-02-08 05:40:26,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9a77bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:26, skipping insertion in model container [2025-02-08 05:40:26,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:25" (2/3) ... [2025-02-08 05:40:26,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9a77bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:26, skipping insertion in model container [2025-02-08 05:40:26,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:26" (3/3) ... [2025-02-08 05:40:26,952 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-02-08 05:40:26,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:26,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 401 locations, 1 initial locations, 7 loop locations, and 99 error locations. [2025-02-08 05:40:26,967 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:27,085 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:40:27,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 413 transitions, 854 flow [2025-02-08 05:40:27,280 INFO L124 PetriNetUnfolderBase]: 13/409 cut-off events. [2025-02-08 05:40:27,282 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:27,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 409 events. 13/409 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 610 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 369. Up to 2 conditions per place. [2025-02-08 05:40:27,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 413 transitions, 854 flow [2025-02-08 05:40:27,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 392 transitions, 808 flow [2025-02-08 05:40:27,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:27,314 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;@5a7c067f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:27,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 154 error locations. [2025-02-08 05:40:27,318 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:27,319 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-08 05:40:27,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:27,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,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] [2025-02-08 05:40:27,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1658522456, now seen corresponding path program 1 times [2025-02-08 05:40:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009323332] [2025-02-08 05:40:27,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:40:27,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:40:27,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009323332] [2025-02-08 05:40:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009323332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845291805] [2025-02-08 05:40:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 413 [2025-02-08 05:40:27,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 392 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:27,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 413 [2025-02-08 05:40:27,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,879 INFO L124 PetriNetUnfolderBase]: 363/1097 cut-off events. [2025-02-08 05:40:27,879 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-02-08 05:40:27,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 1097 events. 363/1097 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5116 event pairs, 272 based on Foata normal form. 7/978 useless extension candidates. Maximal degree in co-relation 1363. Up to 526 conditions per place. [2025-02-08 05:40:27,889 INFO L140 encePairwiseOnDemand]: 338/413 looper letters, 21 selfloop transitions, 2 changer transitions 9/319 dead transitions. [2025-02-08 05:40:27,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 319 transitions, 712 flow [2025-02-08 05:40:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2025-02-08 05:40:27,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83454398708636 [2025-02-08 05:40:27,911 INFO L175 Difference]: Start difference. First operand has 393 places, 392 transitions, 808 flow. Second operand 3 states and 1034 transitions. [2025-02-08 05:40:27,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 319 transitions, 712 flow [2025-02-08 05:40:27,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 319 transitions, 696 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:40:27,926 INFO L231 Difference]: Finished difference. Result has 321 places, 310 transitions, 632 flow [2025-02-08 05:40:27,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=321, PETRI_TRANSITIONS=310} [2025-02-08 05:40:27,932 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -72 predicate places. [2025-02-08 05:40:27,933 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 310 transitions, 632 flow [2025-02-08 05:40:27,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:27,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:27,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1581130424, now seen corresponding path program 1 times [2025-02-08 05:40:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972828477] [2025-02-08 05:40:27,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:40:27,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:40:27,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972828477] [2025-02-08 05:40:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972828477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333379759] [2025-02-08 05:40:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 413 [2025-02-08 05:40:28,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 310 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 413 [2025-02-08 05:40:28,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,215 INFO L124 PetriNetUnfolderBase]: 171/734 cut-off events. [2025-02-08 05:40:28,215 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:28,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 734 events. 171/734 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2638 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 990. Up to 258 conditions per place. [2025-02-08 05:40:28,220 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 20 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-02-08 05:40:28,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 674 flow [2025-02-08 05:40:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-02-08 05:40:28,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764326069410815 [2025-02-08 05:40:28,222 INFO L175 Difference]: Start difference. First operand has 321 places, 310 transitions, 632 flow. Second operand 3 states and 962 transitions. [2025-02-08 05:40:28,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 674 flow [2025-02-08 05:40:28,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 309 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:28,230 INFO L231 Difference]: Finished difference. Result has 311 places, 309 transitions, 630 flow [2025-02-08 05:40:28,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=311, PETRI_TRANSITIONS=309} [2025-02-08 05:40:28,231 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -82 predicate places. [2025-02-08 05:40:28,231 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 309 transitions, 630 flow [2025-02-08 05:40:28,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,232 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] [2025-02-08 05:40:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:28,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash 748398863, now seen corresponding path program 1 times [2025-02-08 05:40:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463032462] [2025-02-08 05:40:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:40:28,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:40:28,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463032462] [2025-02-08 05:40:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463032462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796023467] [2025-02-08 05:40:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 413 [2025-02-08 05:40:28,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 309 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 413 [2025-02-08 05:40:28,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,480 INFO L124 PetriNetUnfolderBase]: 171/733 cut-off events. [2025-02-08 05:40:28,481 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:28,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 733 events. 171/733 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2642 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 981. Up to 258 conditions per place. [2025-02-08 05:40:28,485 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 20 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-02-08 05:40:28,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 672 flow [2025-02-08 05:40:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-02-08 05:40:28,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764326069410815 [2025-02-08 05:40:28,488 INFO L175 Difference]: Start difference. First operand has 311 places, 309 transitions, 630 flow. Second operand 3 states and 962 transitions. [2025-02-08 05:40:28,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 672 flow [2025-02-08 05:40:28,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 308 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:28,493 INFO L231 Difference]: Finished difference. Result has 310 places, 308 transitions, 628 flow [2025-02-08 05:40:28,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=310, PETRI_TRANSITIONS=308} [2025-02-08 05:40:28,494 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -83 predicate places. [2025-02-08 05:40:28,494 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 308 transitions, 628 flow [2025-02-08 05:40:28,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,495 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] [2025-02-08 05:40:28,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:28,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:28,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1049020484, now seen corresponding path program 1 times [2025-02-08 05:40:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284497458] [2025-02-08 05:40:28,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:40:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:40:28,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284497458] [2025-02-08 05:40:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284497458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625583532] [2025-02-08 05:40:28,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 413 [2025-02-08 05:40:28,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 308 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 413 [2025-02-08 05:40:28,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,718 INFO L124 PetriNetUnfolderBase]: 171/732 cut-off events. [2025-02-08 05:40:28,718 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:28,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 732 events. 171/732 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2658 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 972. Up to 258 conditions per place. [2025-02-08 05:40:28,721 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 20 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2025-02-08 05:40:28,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 307 transitions, 670 flow [2025-02-08 05:40:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-02-08 05:40:28,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764326069410815 [2025-02-08 05:40:28,723 INFO L175 Difference]: Start difference. First operand has 310 places, 308 transitions, 628 flow. Second operand 3 states and 962 transitions. [2025-02-08 05:40:28,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 307 transitions, 670 flow [2025-02-08 05:40:28,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 307 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:28,726 INFO L231 Difference]: Finished difference. Result has 309 places, 307 transitions, 626 flow [2025-02-08 05:40:28,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=309, PETRI_TRANSITIONS=307} [2025-02-08 05:40:28,727 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -84 predicate places. [2025-02-08 05:40:28,727 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 307 transitions, 626 flow [2025-02-08 05:40:28,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,728 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] [2025-02-08 05:40:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:28,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1901121078, now seen corresponding path program 1 times [2025-02-08 05:40:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747978029] [2025-02-08 05:40:28,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:40:28,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:40:28,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747978029] [2025-02-08 05:40:28,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747978029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99509802] [2025-02-08 05:40:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 413 [2025-02-08 05:40:28,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 307 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 413 [2025-02-08 05:40:28,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,869 INFO L124 PetriNetUnfolderBase]: 171/731 cut-off events. [2025-02-08 05:40:28,869 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:40:28,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 731 events. 171/731 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2665 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 960. Up to 255 conditions per place. [2025-02-08 05:40:28,872 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 18 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2025-02-08 05:40:28,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 306 transitions, 662 flow [2025-02-08 05:40:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:40:28,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7836965294592413 [2025-02-08 05:40:28,874 INFO L175 Difference]: Start difference. First operand has 309 places, 307 transitions, 626 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:40:28,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 306 transitions, 662 flow [2025-02-08 05:40:28,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 306 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:28,878 INFO L231 Difference]: Finished difference. Result has 308 places, 306 transitions, 622 flow [2025-02-08 05:40:28,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=308, PETRI_TRANSITIONS=306} [2025-02-08 05:40:28,879 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -85 predicate places. [2025-02-08 05:40:28,879 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 306 transitions, 622 flow [2025-02-08 05:40:28,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,879 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] [2025-02-08 05:40:28,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:28,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1512465800, now seen corresponding path program 1 times [2025-02-08 05:40:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319821442] [2025-02-08 05:40:28,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:40:28,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:40:28,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319821442] [2025-02-08 05:40:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319821442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312634530] [2025-02-08 05:40:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 413 [2025-02-08 05:40:28,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 306 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:28,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 413 [2025-02-08 05:40:28,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,025 INFO L124 PetriNetUnfolderBase]: 171/730 cut-off events. [2025-02-08 05:40:29,025 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:29,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 730 events. 171/730 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2667 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 960. Up to 257 conditions per place. [2025-02-08 05:40:29,028 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 19 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-02-08 05:40:29,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 662 flow [2025-02-08 05:40:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:29,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.778046811945117 [2025-02-08 05:40:29,030 INFO L175 Difference]: Start difference. First operand has 308 places, 306 transitions, 622 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:29,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 662 flow [2025-02-08 05:40:29,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 305 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:29,034 INFO L231 Difference]: Finished difference. Result has 308 places, 305 transitions, 623 flow [2025-02-08 05:40:29,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=308, PETRI_TRANSITIONS=305} [2025-02-08 05:40:29,035 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -85 predicate places. [2025-02-08 05:40:29,035 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 305 transitions, 623 flow [2025-02-08 05:40:29,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,035 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] [2025-02-08 05:40:29,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:29,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash -637716398, now seen corresponding path program 1 times [2025-02-08 05:40:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946912311] [2025-02-08 05:40:29,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:40:29,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:40:29,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946912311] [2025-02-08 05:40:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946912311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374760795] [2025-02-08 05:40:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 413 [2025-02-08 05:40:29,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 305 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 413 [2025-02-08 05:40:29,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,201 INFO L124 PetriNetUnfolderBase]: 171/729 cut-off events. [2025-02-08 05:40:29,201 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:29,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 729 events. 171/729 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2650 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 962. Up to 258 conditions per place. [2025-02-08 05:40:29,205 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 20 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-02-08 05:40:29,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 304 transitions, 665 flow [2025-02-08 05:40:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-02-08 05:40:29,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764326069410815 [2025-02-08 05:40:29,208 INFO L175 Difference]: Start difference. First operand has 308 places, 305 transitions, 623 flow. Second operand 3 states and 962 transitions. [2025-02-08 05:40:29,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 304 transitions, 665 flow [2025-02-08 05:40:29,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 304 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:29,212 INFO L231 Difference]: Finished difference. Result has 307 places, 304 transitions, 621 flow [2025-02-08 05:40:29,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2025-02-08 05:40:29,213 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -86 predicate places. [2025-02-08 05:40:29,213 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 621 flow [2025-02-08 05:40:29,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,214 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] [2025-02-08 05:40:29,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:29,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1348370017, now seen corresponding path program 1 times [2025-02-08 05:40:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78212190] [2025-02-08 05:40:29,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:40:29,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:40:29,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78212190] [2025-02-08 05:40:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78212190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435878296] [2025-02-08 05:40:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 413 [2025-02-08 05:40:29,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 413 [2025-02-08 05:40:29,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,392 INFO L124 PetriNetUnfolderBase]: 171/728 cut-off events. [2025-02-08 05:40:29,392 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:40:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 728 events. 171/728 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2654 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 959. Up to 255 conditions per place. [2025-02-08 05:40:29,395 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 18 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2025-02-08 05:40:29,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 303 transitions, 657 flow [2025-02-08 05:40:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:40:29,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7836965294592413 [2025-02-08 05:40:29,397 INFO L175 Difference]: Start difference. First operand has 307 places, 304 transitions, 621 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:40:29,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 303 transitions, 657 flow [2025-02-08 05:40:29,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 303 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:29,401 INFO L231 Difference]: Finished difference. Result has 306 places, 303 transitions, 617 flow [2025-02-08 05:40:29,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=306, PETRI_TRANSITIONS=303} [2025-02-08 05:40:29,402 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -87 predicate places. [2025-02-08 05:40:29,402 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 303 transitions, 617 flow [2025-02-08 05:40:29,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,402 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] [2025-02-08 05:40:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:29,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash 473899755, now seen corresponding path program 1 times [2025-02-08 05:40:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000796660] [2025-02-08 05:40:29,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:40:29,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:40:29,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000796660] [2025-02-08 05:40:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000796660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005450717] [2025-02-08 05:40:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 413 [2025-02-08 05:40:29,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 303 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 413 [2025-02-08 05:40:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,557 INFO L124 PetriNetUnfolderBase]: 171/727 cut-off events. [2025-02-08 05:40:29,557 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:29,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 727 events. 171/727 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2654 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 958. Up to 257 conditions per place. [2025-02-08 05:40:29,560 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 19 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-02-08 05:40:29,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 302 transitions, 657 flow [2025-02-08 05:40:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:29,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.778046811945117 [2025-02-08 05:40:29,563 INFO L175 Difference]: Start difference. First operand has 306 places, 303 transitions, 617 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:29,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 302 transitions, 657 flow [2025-02-08 05:40:29,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 302 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:29,566 INFO L231 Difference]: Finished difference. Result has 306 places, 302 transitions, 618 flow [2025-02-08 05:40:29,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=306, PETRI_TRANSITIONS=302} [2025-02-08 05:40:29,568 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -87 predicate places. [2025-02-08 05:40:29,568 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 302 transitions, 618 flow [2025-02-08 05:40:29,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,569 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] [2025-02-08 05:40:29,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:29,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash 391704574, now seen corresponding path program 1 times [2025-02-08 05:40:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757867207] [2025-02-08 05:40:29,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:40:29,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:40:29,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757867207] [2025-02-08 05:40:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757867207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630845776] [2025-02-08 05:40:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 413 [2025-02-08 05:40:29,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 413 [2025-02-08 05:40:29,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,718 INFO L124 PetriNetUnfolderBase]: 171/726 cut-off events. [2025-02-08 05:40:29,718 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:29,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 726 events. 171/726 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2666 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 957. Up to 255 conditions per place. [2025-02-08 05:40:29,721 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 18 selfloop transitions, 1 changer transitions 0/301 dead transitions. [2025-02-08 05:40:29,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 301 transitions, 654 flow [2025-02-08 05:40:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:40:29,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7836965294592413 [2025-02-08 05:40:29,724 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 618 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:40:29,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 301 transitions, 654 flow [2025-02-08 05:40:29,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 301 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:29,727 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 614 flow [2025-02-08 05:40:29,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2025-02-08 05:40:29,729 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -88 predicate places. [2025-02-08 05:40:29,729 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 614 flow [2025-02-08 05:40:29,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:29,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,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] [2025-02-08 05:40:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:29,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1005884691, now seen corresponding path program 1 times [2025-02-08 05:40:29,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925490521] [2025-02-08 05:40:29,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:40:29,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:40:29,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925490521] [2025-02-08 05:40:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925490521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087104820] [2025-02-08 05:40:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:30,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:30,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:30,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 413 [2025-02-08 05:40:30,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 614 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:30,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:30,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 413 [2025-02-08 05:40:30,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:30,574 INFO L124 PetriNetUnfolderBase]: 171/723 cut-off events. [2025-02-08 05:40:30,574 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 723 events. 171/723 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2648 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 990. Up to 278 conditions per place. [2025-02-08 05:40:30,576 INFO L140 encePairwiseOnDemand]: 395/413 looper letters, 40 selfloop transitions, 15 changer transitions 0/298 dead transitions. [2025-02-08 05:40:30,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 298 transitions, 718 flow [2025-02-08 05:40:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1732 transitions. [2025-02-08 05:40:30,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989507667473769 [2025-02-08 05:40:30,579 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 614 flow. Second operand 6 states and 1732 transitions. [2025-02-08 05:40:30,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 298 transitions, 718 flow [2025-02-08 05:40:30,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 298 transitions, 717 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:30,584 INFO L231 Difference]: Finished difference. Result has 306 places, 298 transitions, 637 flow [2025-02-08 05:40:30,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=306, PETRI_TRANSITIONS=298} [2025-02-08 05:40:30,584 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -87 predicate places. [2025-02-08 05:40:30,585 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 298 transitions, 637 flow [2025-02-08 05:40:30,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:30,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:30,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:30,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:30,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:30,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash -342420068, now seen corresponding path program 1 times [2025-02-08 05:40:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:30,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038092949] [2025-02-08 05:40:30,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:30,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:40:30,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:40:30,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:30,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:30,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038092949] [2025-02-08 05:40:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038092949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:30,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247450078] [2025-02-08 05:40:30,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:30,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:30,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:30,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:30,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 413 [2025-02-08 05:40:30,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:30,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:30,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 413 [2025-02-08 05:40:30,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:30,748 INFO L124 PetriNetUnfolderBase]: 171/722 cut-off events. [2025-02-08 05:40:30,749 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:30,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 722 events. 171/722 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2623 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 984. Up to 257 conditions per place. [2025-02-08 05:40:30,752 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 19 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2025-02-08 05:40:30,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 297 transitions, 677 flow [2025-02-08 05:40:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:30,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.778046811945117 [2025-02-08 05:40:30,755 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 637 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:30,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 297 transitions, 677 flow [2025-02-08 05:40:30,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 297 transitions, 647 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:30,760 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 609 flow [2025-02-08 05:40:30,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2025-02-08 05:40:30,762 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -91 predicate places. [2025-02-08 05:40:30,762 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 609 flow [2025-02-08 05:40:30,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:30,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:30,763 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] [2025-02-08 05:40:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:30,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2073249305, now seen corresponding path program 1 times [2025-02-08 05:40:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816543963] [2025-02-08 05:40:30,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:40:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:40:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:30,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816543963] [2025-02-08 05:40:30,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816543963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:30,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:30,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:30,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683790220] [2025-02-08 05:40:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:30,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:30,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:30,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:30,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 413 [2025-02-08 05:40:30,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:30,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:30,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 413 [2025-02-08 05:40:30,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:30,935 INFO L124 PetriNetUnfolderBase]: 171/721 cut-off events. [2025-02-08 05:40:30,935 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:30,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 721 events. 171/721 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2628 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 953. Up to 255 conditions per place. [2025-02-08 05:40:30,939 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 18 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2025-02-08 05:40:30,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 296 transitions, 645 flow [2025-02-08 05:40:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:40:30,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7836965294592413 [2025-02-08 05:40:30,942 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 609 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:40:30,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 296 transitions, 645 flow [2025-02-08 05:40:30,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 296 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:30,946 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 605 flow [2025-02-08 05:40:30,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2025-02-08 05:40:30,947 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -92 predicate places. [2025-02-08 05:40:30,948 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 605 flow [2025-02-08 05:40:30,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:30,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:30,948 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] [2025-02-08 05:40:30,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:30,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:30,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash -723590986, now seen corresponding path program 1 times [2025-02-08 05:40:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763833834] [2025-02-08 05:40:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:30,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:40:30,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:40:30,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:30,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:30,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763833834] [2025-02-08 05:40:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763833834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:30,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:30,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764353857] [2025-02-08 05:40:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:30,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:30,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:30,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:31,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 413 [2025-02-08 05:40:31,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:31,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 413 [2025-02-08 05:40:31,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:31,127 INFO L124 PetriNetUnfolderBase]: 171/720 cut-off events. [2025-02-08 05:40:31,128 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:31,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 720 events. 171/720 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2625 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 953. Up to 257 conditions per place. [2025-02-08 05:40:31,131 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 19 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-02-08 05:40:31,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 295 transitions, 645 flow [2025-02-08 05:40:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:31,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.778046811945117 [2025-02-08 05:40:31,134 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 605 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:31,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 295 transitions, 645 flow [2025-02-08 05:40:31,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 295 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:31,137 INFO L231 Difference]: Finished difference. Result has 301 places, 295 transitions, 606 flow [2025-02-08 05:40:31,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=301, PETRI_TRANSITIONS=295} [2025-02-08 05:40:31,138 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -92 predicate places. [2025-02-08 05:40:31,138 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 295 transitions, 606 flow [2025-02-08 05:40:31,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:31,139 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] [2025-02-08 05:40:31,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:31,139 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:31,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1758367902, now seen corresponding path program 1 times [2025-02-08 05:40:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:31,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847172860] [2025-02-08 05:40:31,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:40:31,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:40:31,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:31,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847172860] [2025-02-08 05:40:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847172860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932601960] [2025-02-08 05:40:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:31,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:31,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:31,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:31,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 413 [2025-02-08 05:40:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 295 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:31,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 413 [2025-02-08 05:40:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:31,268 INFO L124 PetriNetUnfolderBase]: 171/718 cut-off events. [2025-02-08 05:40:31,268 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:31,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 718 events. 171/718 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2619 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 953. Up to 257 conditions per place. [2025-02-08 05:40:31,271 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 20 selfloop transitions, 1 changer transitions 0/293 dead transitions. [2025-02-08 05:40:31,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 293 transitions, 644 flow [2025-02-08 05:40:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2025-02-08 05:40:31,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7788539144471348 [2025-02-08 05:40:31,273 INFO L175 Difference]: Start difference. First operand has 301 places, 295 transitions, 606 flow. Second operand 3 states and 965 transitions. [2025-02-08 05:40:31,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 293 transitions, 644 flow [2025-02-08 05:40:31,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 293 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:31,277 INFO L231 Difference]: Finished difference. Result has 299 places, 293 transitions, 600 flow [2025-02-08 05:40:31,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=299, PETRI_TRANSITIONS=293} [2025-02-08 05:40:31,277 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -94 predicate places. [2025-02-08 05:40:31,278 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 293 transitions, 600 flow [2025-02-08 05:40:31,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:31,278 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] [2025-02-08 05:40:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:31,278 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1715612346, now seen corresponding path program 1 times [2025-02-08 05:40:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586715700] [2025-02-08 05:40:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:31,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:40:31,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:40:31,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:31,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:31,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586715700] [2025-02-08 05:40:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586715700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553789663] [2025-02-08 05:40:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:31,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:31,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:31,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:31,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 413 [2025-02-08 05:40:31,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 293 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:31,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 413 [2025-02-08 05:40:31,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:31,437 INFO L124 PetriNetUnfolderBase]: 171/717 cut-off events. [2025-02-08 05:40:31,437 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:31,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 717 events. 171/717 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2620 event pairs, 121 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 951. Up to 257 conditions per place. [2025-02-08 05:40:31,440 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 19 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-02-08 05:40:31,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 292 transitions, 640 flow [2025-02-08 05:40:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:31,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.778046811945117 [2025-02-08 05:40:31,442 INFO L175 Difference]: Start difference. First operand has 299 places, 293 transitions, 600 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:31,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 292 transitions, 640 flow [2025-02-08 05:40:31,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 292 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:31,445 INFO L231 Difference]: Finished difference. Result has 299 places, 292 transitions, 601 flow [2025-02-08 05:40:31,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=299, PETRI_TRANSITIONS=292} [2025-02-08 05:40:31,446 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -94 predicate places. [2025-02-08 05:40:31,446 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 292 transitions, 601 flow [2025-02-08 05:40:31,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:31,447 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] [2025-02-08 05:40:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:31,447 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -151373711, now seen corresponding path program 1 times [2025-02-08 05:40:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875444748] [2025-02-08 05:40:31,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-08 05:40:31,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-08 05:40:31,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:31,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:31,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875444748] [2025-02-08 05:40:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875444748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:31,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022468129] [2025-02-08 05:40:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:31,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:31,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:31,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:31,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 413 [2025-02-08 05:40:31,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 292 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:31,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 413 [2025-02-08 05:40:31,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:31,623 INFO L124 PetriNetUnfolderBase]: 171/716 cut-off events. [2025-02-08 05:40:31,623 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:31,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 716 events. 171/716 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2638 event pairs, 121 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 949. Up to 254 conditions per place. [2025-02-08 05:40:31,625 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 0 selfloop transitions, 0 changer transitions 291/291 dead transitions. [2025-02-08 05:40:31,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 291 transitions, 633 flow [2025-02-08 05:40:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2025-02-08 05:40:31,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.784503631961259 [2025-02-08 05:40:31,627 INFO L175 Difference]: Start difference. First operand has 299 places, 292 transitions, 601 flow. Second operand 3 states and 972 transitions. [2025-02-08 05:40:31,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 291 transitions, 633 flow [2025-02-08 05:40:31,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 291 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:31,629 INFO L231 Difference]: Finished difference. Result has 298 places, 0 transitions, 0 flow [2025-02-08 05:40:31,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=298, PETRI_TRANSITIONS=0} [2025-02-08 05:40:31,630 INFO L279 CegarLoopForPetriNet]: 393 programPoint places, -95 predicate places. [2025-02-08 05:40:31,630 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 0 transitions, 0 flow [2025-02-08 05:40:31,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:31,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (153 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (152 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (151 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (150 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (148 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (147 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (146 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (145 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (144 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (142 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (141 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (140 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (139 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (138 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (137 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (135 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (134 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (133 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (132 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (131 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (130 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (129 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (128 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (127 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (126 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (125 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (124 of 154 remaining) [2025-02-08 05:40:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (123 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (122 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (121 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (120 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (119 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (118 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (117 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (116 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (115 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (114 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (113 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (112 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (111 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (110 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (109 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (108 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (107 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (106 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (105 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (104 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (103 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (102 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (101 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (99 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (98 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (97 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (96 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (95 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (94 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (93 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (92 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (91 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (90 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (89 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (88 of 154 remaining) [2025-02-08 05:40:31,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (87 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (86 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (84 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (83 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (82 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (77 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (76 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (75 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (74 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (73 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (72 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (71 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (70 of 154 remaining) [2025-02-08 05:40:31,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (69 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (68 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (67 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (66 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (65 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (64 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (63 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (62 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (61 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (60 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (59 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (57 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (56 of 154 remaining) [2025-02-08 05:40:31,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (55 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (54 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (46 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (45 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (44 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (42 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (41 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (39 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (25 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (24 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (23 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (22 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (21 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (20 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (19 of 154 remaining) [2025-02-08 05:40:31,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 154 remaining) [2025-02-08 05:40:31,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (17 of 154 remaining) [2025-02-08 05:40:31,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (16 of 154 remaining) [2025-02-08 05:40:31,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 154 remaining) [2025-02-08 05:40:31,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (14 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (13 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (12 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (11 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (10 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (9 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (8 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (5 of 154 remaining) [2025-02-08 05:40:31,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (4 of 154 remaining) [2025-02-08 05:40:31,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 154 remaining) [2025-02-08 05:40:31,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (2 of 154 remaining) [2025-02-08 05:40:31,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (1 of 154 remaining) [2025-02-08 05:40:31,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 154 remaining) [2025-02-08 05:40:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:31,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:31,645 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:31,646 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:31,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:31 BasicIcfg [2025-02-08 05:40:31,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:31,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:31,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:31,652 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:31,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:26" (3/4) ... [2025-02-08 05:40:31,655 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:31,656 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:31,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:31,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:31,657 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:40:31,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-08 05:40:31,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:31,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:40:31,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:31,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:31,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:31,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:31,735 INFO L158 Benchmark]: Toolchain (without parser) took 6345.00ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 106.1MB in the beginning and 360.0MB in the end (delta: -254.0MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2025-02-08 05:40:31,735 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:31,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.98ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:31,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.24ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 87.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:31,737 INFO L158 Benchmark]: Boogie Preprocessor took 30.30ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 84.6MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:31,737 INFO L158 Benchmark]: IcfgBuilder took 1273.45ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 73.9MB in the end (delta: 10.7MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2025-02-08 05:40:31,738 INFO L158 Benchmark]: TraceAbstraction took 4706.44ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 73.1MB in the beginning and 368.4MB in the end (delta: -295.3MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:31,738 INFO L158 Benchmark]: Witness Printer took 82.05ms. Allocated memory is still 545.3MB. Free memory was 368.4MB in the beginning and 360.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:31,740 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.98ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.24ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 87.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.30ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 84.6MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1273.45ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 73.9MB in the end (delta: 10.7MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4706.44ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 73.1MB in the beginning and 368.4MB in the end (delta: -295.3MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. * Witness Printer took 82.05ms. Allocated memory is still 545.3MB. Free memory was 368.4MB in the beginning and 360.0MB 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: 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 - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: 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 9 procedures, 502 locations, 154 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 24 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 99 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:31,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE