./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1.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/parallel-parallel-sum-1.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 b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:24,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:24,595 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:39:24,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:24,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:24,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:24,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:24,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:24,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:24,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:24,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:24,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:24,611 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:24,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:24,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:24,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:24,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:24,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:24,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:24,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:24,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:24,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:24,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:24,614 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 -> b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 [2025-02-08 05:39:25,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:25,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:25,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:25,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:25,038 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:25,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-02-08 05:39:26,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a3dddcea/883d5f4830ce4d02accd56543aeb522f/FLAGfa5bdddd8 [2025-02-08 05:39:26,546 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:26,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-02-08 05:39:26,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a3dddcea/883d5f4830ce4d02accd56543aeb522f/FLAGfa5bdddd8 [2025-02-08 05:39:26,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a3dddcea/883d5f4830ce4d02accd56543aeb522f [2025-02-08 05:39:26,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:26,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:26,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:26,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:26,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:26,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:26" (1/1) ... [2025-02-08 05:39:26,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a9f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:26, skipping insertion in model container [2025-02-08 05:39:26,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:26" (1/1) ... [2025-02-08 05:39:26,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:27,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:27,037 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:27,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:27,089 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:27,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27 WrapperNode [2025-02-08 05:39:27,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:27,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:27,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:27,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:27,094 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:39:27" (1/1) ... [2025-02-08 05:39:27,101 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:39:27" (1/1) ... [2025-02-08 05:39:27,127 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 511 [2025-02-08 05:39:27,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:27,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:27,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:27,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:27,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:27,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:27,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:27,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:27,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (1/1) ... [2025-02-08 05:39:27,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:27,193 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:39:27,198 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:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:39:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:27,219 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:39:27,306 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:27,307 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:27,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~nondet7#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume #race~s1~0 == #t~nondet7#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume !(#race~s1~0 == #t~nondet7#1); [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: havoc #t~ret6#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #race~s1~0 := #t~nondet7#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc #t~nondet7#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: ~s1~0 := #t~ret6#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-9: #t~ret6#1 := plus_#res#1; [2025-02-08 05:39:27,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~nondet14#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: assume #race~s1~0 == #t~nondet14#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: assume !(#race~s1~0 == #t~nondet14#1); [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: havoc #t~ret13#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-3: #race~s1~0 := #t~nondet14#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: havoc #t~nondet14#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: ~s1~0 := #t~ret13#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-9: #t~ret13#1 := plus_#res#1; [2025-02-08 05:39:27,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85: havoc #t~nondet21#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-1: assume #race~s2~0 == #t~nondet21#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-1: assume !(#race~s2~0 == #t~nondet21#1); [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-2: havoc #t~ret20#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-3: #race~s2~0 := #t~nondet21#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-4: havoc #t~nondet21#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-5: ~s2~0 := #t~ret20#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-9: #t~ret20#1 := plus_#res#1; [2025-02-08 05:39:27,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: [2025-02-08 05:39:27,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc #t~nondet28#1; [2025-02-08 05:39:27,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: assume #race~s2~0 == #t~nondet28#1; [2025-02-08 05:39:27,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: assume !(#race~s2~0 == #t~nondet28#1); [2025-02-08 05:39:27,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-2: havoc #t~ret27#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-3: #race~s2~0 := #t~nondet28#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-4: havoc #t~nondet28#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-5: ~s2~0 := #t~ret27#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-9: #t~ret27#1 := plus_#res#1; [2025-02-08 05:39:27,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: [2025-02-08 05:39:27,873 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:27,873 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:28,103 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 05:39:28,103 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 05:39:28,104 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 05:39:28,104 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 05:39:28,105 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:28,105 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:28,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:28 BoogieIcfgContainer [2025-02-08 05:39:28,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:28,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:28,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:28,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:28,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:26" (1/3) ... [2025-02-08 05:39:28,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b62697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:28, skipping insertion in model container [2025-02-08 05:39:28,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:27" (2/3) ... [2025-02-08 05:39:28,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b62697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:28, skipping insertion in model container [2025-02-08 05:39:28,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:28" (3/3) ... [2025-02-08 05:39:28,111 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-02-08 05:39:28,121 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:28,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 364 locations, 1 initial locations, 5 loop locations, and 70 error locations. [2025-02-08 05:39:28,122 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:28,179 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:39:28,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 376 places, 378 transitions, 784 flow [2025-02-08 05:39:28,323 INFO L124 PetriNetUnfolderBase]: 15/374 cut-off events. [2025-02-08 05:39:28,324 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:28,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 374 events. 15/374 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 545 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 307. Up to 2 conditions per place. [2025-02-08 05:39:28,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 376 places, 378 transitions, 784 flow [2025-02-08 05:39:28,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 353 transitions, 730 flow [2025-02-08 05:39:28,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:28,351 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6de327b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:28,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 110 error locations. [2025-02-08 05:39:28,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:28,359 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:39:28,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:28,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:28,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:28,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:28,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2135952144, now seen corresponding path program 1 times [2025-02-08 05:39:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040351417] [2025-02-08 05:39:28,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:28,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:39:28,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:39:28,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:28,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:28,502 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:39:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:28,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040351417] [2025-02-08 05:39:28,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040351417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:28,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:28,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001750467] [2025-02-08 05:39:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:28,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:28,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:28,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:28,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 378 [2025-02-08 05:39:28,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 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:39:28,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:28,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 378 [2025-02-08 05:39:28,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:28,810 INFO L124 PetriNetUnfolderBase]: 277/795 cut-off events. [2025-02-08 05:39:28,810 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-02-08 05:39:28,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 795 events. 277/795 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3177 event pairs, 272 based on Foata normal form. 174/916 useless extension candidates. Maximal degree in co-relation 1020. Up to 439 conditions per place. [2025-02-08 05:39:28,817 INFO L140 encePairwiseOnDemand]: 327/378 looper letters, 14 selfloop transitions, 2 changer transitions 20/304 dead transitions. [2025-02-08 05:39:28,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 304 transitions, 680 flow [2025-02-08 05:39:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2025-02-08 05:39:28,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.86331569664903 [2025-02-08 05:39:28,832 INFO L175 Difference]: Start difference. First operand has 353 places, 353 transitions, 730 flow. Second operand 3 states and 979 transitions. [2025-02-08 05:39:28,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 304 transitions, 680 flow [2025-02-08 05:39:28,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 304 transitions, 664 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:39:28,840 INFO L231 Difference]: Finished difference. Result has 306 places, 284 transitions, 580 flow [2025-02-08 05:39:28,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=304, 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=580, PETRI_PLACES=306, PETRI_TRANSITIONS=284} [2025-02-08 05:39:28,844 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -47 predicate places. [2025-02-08 05:39:28,844 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 284 transitions, 580 flow [2025-02-08 05:39:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 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:39:28,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:28,845 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] [2025-02-08 05:39:28,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:28,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:28,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 253170205, now seen corresponding path program 1 times [2025-02-08 05:39:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181410664] [2025-02-08 05:39:28,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:28,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:39:28,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:39:28,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:28,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39: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:39:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:28,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181410664] [2025-02-08 05:39:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181410664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586304771] [2025-02-08 05:39:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:28,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:28,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:28,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:28,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 378 [2025-02-08 05:39:28,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 284 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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:39:28,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:28,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 378 [2025-02-08 05:39:28,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:28,964 INFO L124 PetriNetUnfolderBase]: 5/283 cut-off events. [2025-02-08 05:39:28,964 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:28,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 283 events. 5/283 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 271. Up to 14 conditions per place. [2025-02-08 05:39:28,965 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-02-08 05:39:28,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 283 transitions, 608 flow [2025-02-08 05:39:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-02-08 05:39:28,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156966490299824 [2025-02-08 05:39:28,968 INFO L175 Difference]: Start difference. First operand has 306 places, 284 transitions, 580 flow. Second operand 3 states and 925 transitions. [2025-02-08 05:39:28,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 283 transitions, 608 flow [2025-02-08 05:39:28,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 283 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:28,972 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 578 flow [2025-02-08 05:39:28,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2025-02-08 05:39:28,973 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -68 predicate places. [2025-02-08 05:39:28,973 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 578 flow [2025-02-08 05:39:28,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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:39:28,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:28,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:28,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:28,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1194399009, now seen corresponding path program 1 times [2025-02-08 05:39:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320788984] [2025-02-08 05:39:28,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:28,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:39:28,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:39:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,020 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:39:29,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320788984] [2025-02-08 05:39:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320788984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390111462] [2025-02-08 05:39:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:29,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 283 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:29,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,065 INFO L124 PetriNetUnfolderBase]: 5/282 cut-off events. [2025-02-08 05:39:29,065 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 282 events. 5/282 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 204 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 260. Up to 12 conditions per place. [2025-02-08 05:39:29,066 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-02-08 05:39:29,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 282 transitions, 602 flow [2025-02-08 05:39:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-02-08 05:39:29,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8192239858906526 [2025-02-08 05:39:29,069 INFO L175 Difference]: Start difference. First operand has 285 places, 283 transitions, 578 flow. Second operand 3 states and 929 transitions. [2025-02-08 05:39:29,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 282 transitions, 602 flow [2025-02-08 05:39:29,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,074 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 576 flow [2025-02-08 05:39:29,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2025-02-08 05:39:29,075 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -69 predicate places. [2025-02-08 05:39:29,075 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 576 flow [2025-02-08 05:39:29,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,075 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] [2025-02-08 05:39:29,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:29,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 112140084, now seen corresponding path program 1 times [2025-02-08 05:39:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104801615] [2025-02-08 05:39:29,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:39:29,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:39:29,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,111 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:39:29,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104801615] [2025-02-08 05:39:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104801615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105468107] [2025-02-08 05:39:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:29,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:29,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,156 INFO L124 PetriNetUnfolderBase]: 5/281 cut-off events. [2025-02-08 05:39:29,156 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 281 events. 5/281 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 202 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 251. Up to 12 conditions per place. [2025-02-08 05:39:29,157 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 11 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-08 05:39:29,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 281 transitions, 600 flow [2025-02-08 05:39:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-02-08 05:39:29,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8192239858906526 [2025-02-08 05:39:29,160 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 576 flow. Second operand 3 states and 929 transitions. [2025-02-08 05:39:29,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 281 transitions, 600 flow [2025-02-08 05:39:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,164 INFO L231 Difference]: Finished difference. Result has 283 places, 281 transitions, 574 flow [2025-02-08 05:39:29,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=283, PETRI_TRANSITIONS=281} [2025-02-08 05:39:29,165 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -70 predicate places. [2025-02-08 05:39:29,165 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 281 transitions, 574 flow [2025-02-08 05:39:29,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,166 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] [2025-02-08 05:39:29,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:29,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1845658754, now seen corresponding path program 1 times [2025-02-08 05:39:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255038477] [2025-02-08 05:39:29,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:39:29,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:39:29,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,209 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:39:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255038477] [2025-02-08 05:39:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255038477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943942049] [2025-02-08 05:39:29,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:29,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 281 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:29,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,262 INFO L124 PetriNetUnfolderBase]: 5/280 cut-off events. [2025-02-08 05:39:29,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 280 events. 5/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 199 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 242. Up to 12 conditions per place. [2025-02-08 05:39:29,264 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-02-08 05:39:29,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 280 transitions, 598 flow [2025-02-08 05:39:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-02-08 05:39:29,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8192239858906526 [2025-02-08 05:39:29,267 INFO L175 Difference]: Start difference. First operand has 283 places, 281 transitions, 574 flow. Second operand 3 states and 929 transitions. [2025-02-08 05:39:29,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 280 transitions, 598 flow [2025-02-08 05:39:29,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 280 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,271 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 572 flow [2025-02-08 05:39:29,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2025-02-08 05:39:29,273 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -71 predicate places. [2025-02-08 05:39:29,274 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 572 flow [2025-02-08 05:39:29,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,275 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] [2025-02-08 05:39:29,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:29,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,278 INFO L85 PathProgramCache]: Analyzing trace with hash -524633182, now seen corresponding path program 1 times [2025-02-08 05:39:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004180149] [2025-02-08 05:39:29,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:39:29,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:39:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,353 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:39:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004180149] [2025-02-08 05:39:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004180149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034334163] [2025-02-08 05:39:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:29,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:29,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,469 INFO L124 PetriNetUnfolderBase]: 5/279 cut-off events. [2025-02-08 05:39:29,472 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 279 events. 5/279 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 196 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 233. Up to 12 conditions per place. [2025-02-08 05:39:29,474 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 11 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-02-08 05:39:29,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 279 transitions, 596 flow [2025-02-08 05:39:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-02-08 05:39:29,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8192239858906526 [2025-02-08 05:39:29,480 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 572 flow. Second operand 3 states and 929 transitions. [2025-02-08 05:39:29,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 279 transitions, 596 flow [2025-02-08 05:39:29,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 279 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,485 INFO L231 Difference]: Finished difference. Result has 281 places, 279 transitions, 570 flow [2025-02-08 05:39:29,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=281, PETRI_TRANSITIONS=279} [2025-02-08 05:39:29,490 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -72 predicate places. [2025-02-08 05:39:29,490 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 279 transitions, 570 flow [2025-02-08 05:39:29,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:29,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,491 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] [2025-02-08 05:39:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:29,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -504619224, now seen corresponding path program 1 times [2025-02-08 05:39:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836074274] [2025-02-08 05:39:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:39:29,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:39:29,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,540 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:39:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836074274] [2025-02-08 05:39:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836074274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561545729] [2025-02-08 05:39:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 378 [2025-02-08 05:39:29,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 279 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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:39:29,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 378 [2025-02-08 05:39:29,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,631 INFO L124 PetriNetUnfolderBase]: 5/278 cut-off events. [2025-02-08 05:39:29,631 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 278 events. 5/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 229. Up to 17 conditions per place. [2025-02-08 05:39:29,632 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 16 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-02-08 05:39:29,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 278 transitions, 604 flow [2025-02-08 05:39:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-02-08 05:39:29,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.810405643738977 [2025-02-08 05:39:29,636 INFO L175 Difference]: Start difference. First operand has 281 places, 279 transitions, 570 flow. Second operand 3 states and 919 transitions. [2025-02-08 05:39:29,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 278 transitions, 604 flow [2025-02-08 05:39:29,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 278 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,640 INFO L231 Difference]: Finished difference. Result has 280 places, 278 transitions, 568 flow [2025-02-08 05:39:29,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2025-02-08 05:39:29,642 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -73 predicate places. [2025-02-08 05:39:29,642 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 568 flow [2025-02-08 05:39:29,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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:39:29,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,643 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] [2025-02-08 05:39:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:29,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2066296770, now seen corresponding path program 1 times [2025-02-08 05:39:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389669973] [2025-02-08 05:39:29,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:39:29,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:39:29,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,703 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:39:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389669973] [2025-02-08 05:39:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389669973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800884010] [2025-02-08 05:39:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 378 [2025-02-08 05:39:29,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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:39:29,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 378 [2025-02-08 05:39:29,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,759 INFO L124 PetriNetUnfolderBase]: 5/277 cut-off events. [2025-02-08 05:39:29,760 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 277 events. 5/277 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 193 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 217. Up to 14 conditions per place. [2025-02-08 05:39:29,761 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 13 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-02-08 05:39:29,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 277 transitions, 596 flow [2025-02-08 05:39:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-02-08 05:39:29,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156966490299824 [2025-02-08 05:39:29,763 INFO L175 Difference]: Start difference. First operand has 280 places, 278 transitions, 568 flow. Second operand 3 states and 925 transitions. [2025-02-08 05:39:29,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 277 transitions, 596 flow [2025-02-08 05:39:29,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 277 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,767 INFO L231 Difference]: Finished difference. Result has 279 places, 277 transitions, 566 flow [2025-02-08 05:39:29,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=279, PETRI_TRANSITIONS=277} [2025-02-08 05:39:29,772 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -74 predicate places. [2025-02-08 05:39:29,772 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 277 transitions, 566 flow [2025-02-08 05:39:29,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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:39:29,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,773 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] [2025-02-08 05:39:29,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:29,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 115988765, now seen corresponding path program 1 times [2025-02-08 05:39:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722243216] [2025-02-08 05:39:29,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:39:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:39:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,849 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:39:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722243216] [2025-02-08 05:39:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722243216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447038274] [2025-02-08 05:39:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 378 [2025-02-08 05:39:29,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 277 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 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:39:29,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 378 [2025-02-08 05:39:29,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:29,908 INFO L124 PetriNetUnfolderBase]: 5/276 cut-off events. [2025-02-08 05:39:29,908 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:29,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 276 events. 5/276 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 193 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 209. Up to 15 conditions per place. [2025-02-08 05:39:29,909 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 14 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:39:29,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 596 flow [2025-02-08 05:39:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-02-08 05:39:29,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139329805996472 [2025-02-08 05:39:29,912 INFO L175 Difference]: Start difference. First operand has 279 places, 277 transitions, 566 flow. Second operand 3 states and 923 transitions. [2025-02-08 05:39:29,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 596 flow [2025-02-08 05:39:29,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:29,916 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 564 flow [2025-02-08 05:39:29,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-02-08 05:39:29,917 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -75 predicate places. [2025-02-08 05:39:29,917 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 564 flow [2025-02-08 05:39:29,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 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:39:29,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:29,918 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] [2025-02-08 05:39:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:29,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1612897749, now seen corresponding path program 1 times [2025-02-08 05:39:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883284447] [2025-02-08 05:39:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:29,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:39:29,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:39:29,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:29,960 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:39:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883284447] [2025-02-08 05:39:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883284447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:29,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268733556] [2025-02-08 05:39:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:29,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:29,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 378 [2025-02-08 05:39:29,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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:39:29,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:29,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 378 [2025-02-08 05:39:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,006 INFO L124 PetriNetUnfolderBase]: 5/273 cut-off events. [2025-02-08 05:39:30,006 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:30,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 273 events. 5/273 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 184 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 197. Up to 14 conditions per place. [2025-02-08 05:39:30,008 INFO L140 encePairwiseOnDemand]: 374/378 looper letters, 14 selfloop transitions, 1 changer transitions 0/273 dead transitions. [2025-02-08 05:39:30,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 273 transitions, 588 flow [2025-02-08 05:39:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-02-08 05:39:30,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2025-02-08 05:39:30,010 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 564 flow. Second operand 3 states and 924 transitions. [2025-02-08 05:39:30,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 273 transitions, 588 flow [2025-02-08 05:39:30,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:30,032 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 556 flow [2025-02-08 05:39:30,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2025-02-08 05:39:30,034 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -78 predicate places. [2025-02-08 05:39:30,034 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 556 flow [2025-02-08 05:39:30,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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:39:30,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:30,035 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:30,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -700144562, now seen corresponding path program 1 times [2025-02-08 05:39:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913771619] [2025-02-08 05:39:30,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:39:30,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:39:30,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,081 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:39:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913771619] [2025-02-08 05:39:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913771619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882993583] [2025-02-08 05:39:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:30,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:30,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:30,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,142 INFO L124 PetriNetUnfolderBase]: 5/272 cut-off events. [2025-02-08 05:39:30,146 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:30,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 272 events. 5/272 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 177 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 193. Up to 12 conditions per place. [2025-02-08 05:39:30,148 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 11 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-02-08 05:39:30,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 272 transitions, 580 flow [2025-02-08 05:39:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-02-08 05:39:30,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8192239858906526 [2025-02-08 05:39:30,153 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 556 flow. Second operand 3 states and 929 transitions. [2025-02-08 05:39:30,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 272 transitions, 580 flow [2025-02-08 05:39:30,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 272 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:30,156 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 557 flow [2025-02-08 05:39:30,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2025-02-08 05:39:30,157 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -78 predicate places. [2025-02-08 05:39:30,157 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 557 flow [2025-02-08 05:39:30,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 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:39:30,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,158 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] [2025-02-08 05:39:30,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:30,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:30,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1996121217, now seen corresponding path program 1 times [2025-02-08 05:39:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655534531] [2025-02-08 05:39:30,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:39:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:39:30,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,668 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:39:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655534531] [2025-02-08 05:39:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655534531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234869820] [2025-02-08 05:39:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:30,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:30,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 378 [2025-02-08 05:39:30,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:30,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 378 [2025-02-08 05:39:30,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,795 INFO L124 PetriNetUnfolderBase]: 5/271 cut-off events. [2025-02-08 05:39:30,795 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:30,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 271 events. 5/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 203. Up to 17 conditions per place. [2025-02-08 05:39:30,796 INFO L140 encePairwiseOnDemand]: 372/378 looper letters, 16 selfloop transitions, 5 changer transitions 0/271 dead transitions. [2025-02-08 05:39:30,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 271 transitions, 597 flow [2025-02-08 05:39:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1810 transitions. [2025-02-08 05:39:30,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7980599647266314 [2025-02-08 05:39:30,800 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 557 flow. Second operand 6 states and 1810 transitions. [2025-02-08 05:39:30,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 271 transitions, 597 flow [2025-02-08 05:39:30,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 271 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:30,803 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 561 flow [2025-02-08 05:39:30,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2025-02-08 05:39:30,804 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -76 predicate places. [2025-02-08 05:39:30,804 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 561 flow [2025-02-08 05:39:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:30,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,806 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] [2025-02-08 05:39:30,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:30,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash 565611511, now seen corresponding path program 1 times [2025-02-08 05:39:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536163764] [2025-02-08 05:39:30,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:39:30,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:39:30,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,847 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:39:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536163764] [2025-02-08 05:39:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536163764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977910776] [2025-02-08 05:39:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 378 [2025-02-08 05:39:30,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 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:39:30,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 378 [2025-02-08 05:39:30,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,896 INFO L124 PetriNetUnfolderBase]: 5/266 cut-off events. [2025-02-08 05:39:30,896 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:30,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 266 events. 5/266 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 280. Up to 18 conditions per place. [2025-02-08 05:39:30,897 INFO L140 encePairwiseOnDemand]: 372/378 looper letters, 18 selfloop transitions, 1 changer transitions 0/266 dead transitions. [2025-02-08 05:39:30,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 266 transitions, 589 flow [2025-02-08 05:39:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 912 transitions. [2025-02-08 05:39:30,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8042328042328042 [2025-02-08 05:39:30,899 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 561 flow. Second operand 3 states and 912 transitions. [2025-02-08 05:39:30,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 266 transitions, 589 flow [2025-02-08 05:39:30,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 266 transitions, 579 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:30,902 INFO L231 Difference]: Finished difference. Result has 269 places, 266 transitions, 543 flow [2025-02-08 05:39:30,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=269, PETRI_TRANSITIONS=266} [2025-02-08 05:39:30,903 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -84 predicate places. [2025-02-08 05:39:30,903 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 266 transitions, 543 flow [2025-02-08 05:39:30,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 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:39:30,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,904 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] [2025-02-08 05:39:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:30,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:30,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1908148185, now seen corresponding path program 1 times [2025-02-08 05:39:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119539104] [2025-02-08 05:39:30,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:39:30,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:39:30,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,939 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:39:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119539104] [2025-02-08 05:39:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119539104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370326138] [2025-02-08 05:39:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:30,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 266 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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:39:30,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:30,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:30,973 INFO L124 PetriNetUnfolderBase]: 5/264 cut-off events. [2025-02-08 05:39:30,973 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:30,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 264 events. 5/264 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 156 event pairs, 0 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-02-08 05:39:30,974 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 10 selfloop transitions, 1 changer transitions 10/264 dead transitions. [2025-02-08 05:39:30,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 264 transitions, 563 flow [2025-02-08 05:39:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-02-08 05:39:30,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8192239858906526 [2025-02-08 05:39:30,976 INFO L175 Difference]: Start difference. First operand has 269 places, 266 transitions, 543 flow. Second operand 3 states and 929 transitions. [2025-02-08 05:39:30,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 264 transitions, 563 flow [2025-02-08 05:39:30,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 264 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:30,979 INFO L231 Difference]: Finished difference. Result has 268 places, 254 transitions, 520 flow [2025-02-08 05:39:30,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=268, PETRI_TRANSITIONS=254} [2025-02-08 05:39:30,980 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -85 predicate places. [2025-02-08 05:39:30,980 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 254 transitions, 520 flow [2025-02-08 05:39:30,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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:39:30,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,980 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] [2025-02-08 05:39:30,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:30,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:30,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1329442304, now seen corresponding path program 1 times [2025-02-08 05:39:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569551705] [2025-02-08 05:39:30,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:39:30,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:39:30,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,014 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:39:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569551705] [2025-02-08 05:39:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569551705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750355001] [2025-02-08 05:39:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 378 [2025-02-08 05:39:31,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 254 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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:39:31,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 378 [2025-02-08 05:39:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,065 INFO L124 PetriNetUnfolderBase]: 6/332 cut-off events. [2025-02-08 05:39:31,065 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:31,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 332 events. 6/332 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 478 event pairs, 0 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 269. Up to 14 conditions per place. [2025-02-08 05:39:31,066 INFO L140 encePairwiseOnDemand]: 373/378 looper letters, 20 selfloop transitions, 2 changer transitions 4/260 dead transitions. [2025-02-08 05:39:31,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 260 transitions, 586 flow [2025-02-08 05:39:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2025-02-08 05:39:31,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8218694885361552 [2025-02-08 05:39:31,068 INFO L175 Difference]: Start difference. First operand has 268 places, 254 transitions, 520 flow. Second operand 3 states and 932 transitions. [2025-02-08 05:39:31,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 260 transitions, 586 flow [2025-02-08 05:39:31,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 260 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:31,073 INFO L231 Difference]: Finished difference. Result has 258 places, 248 transitions, 515 flow [2025-02-08 05:39:31,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=258, PETRI_TRANSITIONS=248} [2025-02-08 05:39:31,074 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -95 predicate places. [2025-02-08 05:39:31,074 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 248 transitions, 515 flow [2025-02-08 05:39:31,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 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:39:31,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,075 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] [2025-02-08 05:39:31,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:31,076 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 106 more)] === [2025-02-08 05:39:31,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2047307804, now seen corresponding path program 1 times [2025-02-08 05:39:31,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122221819] [2025-02-08 05:39:31,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:39:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:39:31,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,109 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:39:31,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122221819] [2025-02-08 05:39:31,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122221819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465396351] [2025-02-08 05:39:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 378 [2025-02-08 05:39:31,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 248 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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:39:31,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 378 [2025-02-08 05:39:31,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,164 INFO L124 PetriNetUnfolderBase]: 8/471 cut-off events. [2025-02-08 05:39:31,164 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:31,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 471 events. 8/471 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1390 event pairs, 0 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 440. Up to 22 conditions per place. [2025-02-08 05:39:31,165 INFO L140 encePairwiseOnDemand]: 374/378 looper letters, 0 selfloop transitions, 0 changer transitions 255/255 dead transitions. [2025-02-08 05:39:31,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 255 transitions, 579 flow [2025-02-08 05:39:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 938 transitions. [2025-02-08 05:39:31,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8271604938271605 [2025-02-08 05:39:31,167 INFO L175 Difference]: Start difference. First operand has 258 places, 248 transitions, 515 flow. Second operand 3 states and 938 transitions. [2025-02-08 05:39:31,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 255 transitions, 579 flow [2025-02-08 05:39:31,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 255 transitions, 579 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:31,169 INFO L231 Difference]: Finished difference. Result has 254 places, 0 transitions, 0 flow [2025-02-08 05:39:31,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=254, PETRI_TRANSITIONS=0} [2025-02-08 05:39:31,170 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -99 predicate places. [2025-02-08 05:39:31,170 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 0 transitions, 0 flow [2025-02-08 05:39:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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:39:31,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (109 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (108 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (107 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (106 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (105 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (104 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (103 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (102 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (101 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (100 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (99 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (98 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (97 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (96 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (94 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (92 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (91 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (90 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (89 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (88 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (87 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (86 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (85 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (84 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (83 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (82 of 110 remaining) [2025-02-08 05:39:31,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (81 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (79 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (78 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (77 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (76 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (75 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (74 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (73 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (72 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (71 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (70 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (69 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (68 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (67 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (66 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (65 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (63 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (62 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (61 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (60 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (59 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (58 of 110 remaining) [2025-02-08 05:39:31,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (57 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (56 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (49 of 110 remaining) [2025-02-08 05:39:31,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (48 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (47 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (46 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (45 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (44 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (43 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (42 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (41 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (40 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (39 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (37 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (34 of 110 remaining) [2025-02-08 05:39:31,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (29 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (28 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (26 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (19 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (18 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (17 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (16 of 110 remaining) [2025-02-08 05:39:31,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (14 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (8 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (7 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (6 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (5 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (4 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (3 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (2 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (1 of 110 remaining) [2025-02-08 05:39:31,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (0 of 110 remaining) [2025-02-08 05:39:31,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:31,178 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:31,182 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:31,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:31,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:31 BasicIcfg [2025-02-08 05:39:31,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:31,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:31,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:31,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:31,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:28" (3/4) ... [2025-02-08 05:39:31,191 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:31,193 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:31,193 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:31,193 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:31,193 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:39:31,201 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 05:39:31,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:31,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:39:31,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:31,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:31,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:31,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:31,325 INFO L158 Benchmark]: Toolchain (without parser) took 4478.36ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.0MB in the beginning and 101.7MB in the end (delta: 3.3MB). Peak memory consumption was 184.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:31,325 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:31,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.43ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 92.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:31,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.06ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 88.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:31,325 INFO L158 Benchmark]: Boogie Preprocessor took 25.38ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:31,326 INFO L158 Benchmark]: IcfgBuilder took 948.89ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 63.1MB in the end (delta: 22.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-02-08 05:39:31,326 INFO L158 Benchmark]: TraceAbstraction took 3079.22ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 62.4MB in the beginning and 110.0MB in the end (delta: -47.7MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. [2025-02-08 05:39:31,326 INFO L158 Benchmark]: Witness Printer took 137.93ms. Allocated memory is still 327.2MB. Free memory was 110.0MB in the beginning and 101.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:31,329 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.21ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.43ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 92.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.06ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 88.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.38ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 948.89ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 63.1MB in the end (delta: 22.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3079.22ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 62.4MB in the beginning and 110.0MB in the end (delta: -47.7MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. * Witness Printer took 137.93ms. Allocated memory is still 327.2MB. Free memory was 110.0MB in the beginning and 101.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: 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: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: 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: 135]: 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: 135]: 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: 135]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: 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, 456 locations, 110 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: 3.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 566 IncrementalHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 69 mSDtfsCounter, 566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=730occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1476 NumberOfCodeBlocks, 1476 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 70 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:31,356 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