./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i --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/pthread-divine/ring_2w1r-1.i -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 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:29:13,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:29:13,683 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:29:13,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:29:13,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:29:13,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:29:13,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:29:13,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:29:13,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:29:13,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:29:13,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:29:13,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:29:13,723 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:29:13,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:29:13,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:29:13,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:29:13,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:29:13,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:29:13,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:29:13,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:29:13,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:13,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:29:13,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:29:13,727 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 -> 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f [2025-02-08 05:29:14,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:29:14,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:29:14,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:29:14,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:29:14,014 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:29:14,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2025-02-08 05:29:15,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bfffedd2/60289ed1b2b044c0bc37e82f04c31c64/FLAG0938a2bab [2025-02-08 05:29:15,720 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:29:15,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2025-02-08 05:29:15,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bfffedd2/60289ed1b2b044c0bc37e82f04c31c64/FLAG0938a2bab [2025-02-08 05:29:15,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bfffedd2/60289ed1b2b044c0bc37e82f04c31c64 [2025-02-08 05:29:15,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:29:15,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:29:15,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:15,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:29:15,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:29:15,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:15" (1/1) ... [2025-02-08 05:29:15,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7ee4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:15, skipping insertion in model container [2025-02-08 05:29:15,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:15" (1/1) ... [2025-02-08 05:29:15,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:29:16,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:16,499 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:29:16,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:16,635 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:29:16,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16 WrapperNode [2025-02-08 05:29:16,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:16,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:16,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:29:16,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:29:16,642 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:29:16" (1/1) ... [2025-02-08 05:29:16,663 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:29:16" (1/1) ... [2025-02-08 05:29:16,700 INFO L138 Inliner]: procedures = 310, calls = 69, calls flagged for inlining = 17, calls inlined = 12, statements flattened = 336 [2025-02-08 05:29:16,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:16,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:29:16,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:29:16,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:29:16,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:29:16,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:29:16,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:29:16,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:29:16,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (1/1) ... [2025-02-08 05:29:16,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:29:16,798 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:29:16,802 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:29:16,823 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2025-02-08 05:29:16,823 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2025-02-08 05:29:16,824 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:29:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:29:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:29:16,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:29:16,826 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:29:16,974 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:29:16,976 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:29:17,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-2: assume false; [2025-02-08 05:29:17,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-2: assume !false; [2025-02-08 05:29:17,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-2: assume { :end_inline_ring_dequeue } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647; [2025-02-08 05:29:17,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-3: assume false; [2025-02-08 05:29:17,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-3: havoc ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset; [2025-02-08 05:29:17,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-4: assume false; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-4: assume !false; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-4: havoc ring_dequeue_#t~mem10#1, ring_dequeue_#t~mem11#1, ring_dequeue_#t~mem12#1, ring_dequeue_#t~nondet13#1, ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, ring_dequeue_~x~0#1; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-5: assume false; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-5: #t~ret29#1 := ring_dequeue_#res#1; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-6: assume false; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-6: assume !false; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-6: havoc ring_dequeue_#t~mem10#1, ring_dequeue_#t~mem11#1, ring_dequeue_#t~mem12#1, ring_dequeue_#t~nondet13#1, ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, ring_dequeue_~x~0#1; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-7: assume false; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-7: havoc ring_dequeue_#res#1; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-8: assume { :begin_inline_ring_dequeue } true;ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset := ~r~2#1.base, ~r~2#1.offset; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-1: assume !(~val~1#1 > 0); [2025-02-08 05:29:17,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-1: assume !!(~val~1#1 > 0); [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: assume !(~val~1#1 <= 8); [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: assume !!(~val~1#1 <= 8); [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset := ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062: havoc #t~nondet32#1; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-1: havoc #t~pre31#1; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume ((#race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] == #t~nondet32#1 && #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet32#1) && #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet32#1) && #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet32#1; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume !(((#race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] == #t~nondet32#1 && #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet32#1) && #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet32#1) && #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet32#1); [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-3: havoc #t~mem30#1; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-4: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := #t~nondet32#1]; [2025-02-08 05:29:17,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-5: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := #t~nondet32#1]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-6: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := #t~nondet32#1]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-7: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1) := #t~nondet32#1]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-8: havoc #t~nondet32#1; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-9: SUMMARY for call write~int(1 + #t~mem30#1, ~#read~0#1.base, ~#read~0#1.offset + 4 * (~val~1#1 - 1), 4); srcloc: null [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-10: assume ((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-10: assume !(((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]); [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-11: #t~pre31#1 := 1 + #t~mem30#1; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-12: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := 0]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-13: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := 0]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-14: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := 0]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-15: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1) := 0]; [2025-02-08 05:29:17,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-16: SUMMARY for call #t~mem30#1 := read~int(~#read~0#1.base, ~#read~0#1.offset + 4 * (~val~1#1 - 1), 4); srcloc: null [2025-02-08 05:29:17,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: havoc ring_dequeue_#t~mem11#1; [2025-02-08 05:29:17,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-1: havoc ring_dequeue_#t~mem10#1; [2025-02-08 05:29:17,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-2: assume ((0 == #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1] && 0 == #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]; [2025-02-08 05:29:17,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-2: assume !(((0 == #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1] && 0 == #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]); [2025-02-08 05:29:17,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-3: ring_dequeue_~x~0#1 := ring_dequeue_#t~mem11#1; [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-4: #race := #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-5: #race := #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-6: #race := #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-7: #race := #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1 := 0]; [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063: assume ~i~3#1 < ~val~1#1; [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063: assume !(~i~3#1 < ~val~1#1); [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-8: SUMMARY for call ring_dequeue_#t~mem11#1 := read~int(ring_dequeue_~r#1.base, 4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1, 4); srcloc: null [2025-02-08 05:29:17,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-1: havoc #t~pre35#1; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-9: assume ((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-9: assume !(((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]); [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-2: ~i~3#1 := 1 + ~i~3#1; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-10: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-3: #t~pre35#1 := 1 + ~i~3#1; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-11: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-4: havoc ~i~3#1; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-12: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-5: ~i~3#1 := 0; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-13: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-14: SUMMARY for call ring_dequeue_#t~mem10#1 := read~int(ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055: havoc ~#read~0#1.base, ~#read~0#1.offset; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-1: SUMMARY for call ULTIMATE.dealloc(~#read~0#1.base, ~#read~0#1.offset); srcloc: null [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: assume ((#race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1 && #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: assume !(((#race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1 && #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1); [2025-02-08 05:29:17,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-2: havoc ring_dequeue_#t~mem12#1; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-3: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-4: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-5: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-6: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-7: havoc ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064: havoc #t~mem33#1; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-8: SUMMARY for call write~int((if 1 + ring_dequeue_#t~mem12#1 < 0 && 0 != (1 + ring_dequeue_#t~mem12#1) % 4 then (1 + ring_dequeue_#t~mem12#1) % 4 - 4 else (1 + ring_dequeue_#t~mem12#1) % 4), ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-1: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-9: assume ((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-9: assume !(((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]); [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-2: assume !(#t~mem33#1 <= 2); [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-2: assume !!(#t~mem33#1 <= 2); [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-10: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:17,355 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-11: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-4: assume ((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]; [2025-02-08 05:29:17,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-4: assume !(((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]); [2025-02-08 05:29:17,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-12: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-5: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:17,356 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-13: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:17,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-6: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:17,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-14: SUMMARY for call ring_dequeue_#t~mem12#1 := read~int(ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:17,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-7: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-8: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1 := 0]; [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-9: SUMMARY for call #t~mem33#1 := read~int(~#read~0#1.base, ~#read~0#1.offset + 4 * ~i~3#1, 4); srcloc: null [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L817-1: ring_dequeue_#res#1 := ring_dequeue_~x~0#1; [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065: havoc #t~mem34#1; [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-1: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-2: assume !(#t~mem34#1 > 0); [2025-02-08 05:29:17,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-2: assume !!(#t~mem34#1 > 0); [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-4: assume ((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-4: assume !(((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]); [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-5: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-6: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-7: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-8: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1 := 0]; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057: assume 0 != #t~ret28#1 % 256; [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057: assume !(0 != #t~ret28#1 % 256); [2025-02-08 05:29:17,360 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-9: SUMMARY for call #t~mem34#1 := read~int(~#read~0#1.base, ~#read~0#1.offset + 4 * ~i~3#1, 4); srcloc: null [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-1: havoc #t~ret28#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-2: havoc #t~ret28#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-3: havoc ring_empty_#in~r#1.base, ring_empty_#in~r#1.offset;assume { :end_inline_ring_empty } true; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-4: havoc ring_empty_#t~mem14#1, ring_empty_#t~mem15#1, ring_empty_~r#1.base, ring_empty_~r#1.offset; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-5: #t~ret28#1 := ring_empty_#res#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067: havoc #t~pre36#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-1: ~i~2#1 := 1 + ~i~2#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-2: #t~pre36#1 := 1 + ~i~2#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume false; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume !false; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: havoc #t~ret29#1; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-1: assume false; [2025-02-08 05:29:17,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-1: ~val~1#1 := #t~ret29#1; [2025-02-08 05:29:17,743 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:29:17,743 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:29:17,780 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:29:17,781 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:29:17,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:17 BoogieIcfgContainer [2025-02-08 05:29:17,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:29:17,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:29:17,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:29:17,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:29:17,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:29:15" (1/3) ... [2025-02-08 05:29:17,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a8cdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:17, skipping insertion in model container [2025-02-08 05:29:17,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:16" (2/3) ... [2025-02-08 05:29:17,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a8cdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:17, skipping insertion in model container [2025-02-08 05:29:17,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:17" (3/3) ... [2025-02-08 05:29:17,790 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2025-02-08 05:29:17,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:29:17,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_2w1r-1.i that has 3 procedures, 265 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-02-08 05:29:17,804 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:29:17,914 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:29:17,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 270 transitions, 554 flow [2025-02-08 05:29:18,070 INFO L124 PetriNetUnfolderBase]: 6/268 cut-off events. [2025-02-08 05:29:18,072 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:29:18,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 268 events. 6/268 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 729 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2025-02-08 05:29:18,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 270 transitions, 554 flow [2025-02-08 05:29:18,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 533 flow [2025-02-08 05:29:18,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:29:18,113 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;@72e80d79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:29:18,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 05:29:18,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:29:18,125 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-08 05:29:18,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:29:18,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:18,126 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] [2025-02-08 05:29:18,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1618348015, now seen corresponding path program 1 times [2025-02-08 05:29:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571306918] [2025-02-08 05:29:18,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:18,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:29:18,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:29:18,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:18,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:18,897 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:29:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571306918] [2025-02-08 05:29:18,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571306918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:18,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:18,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89349565] [2025-02-08 05:29:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:18,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:18,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:18,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:19,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 270 [2025-02-08 05:29:19,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 533 flow. Second operand has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 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:29:19,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:19,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 270 [2025-02-08 05:29:19,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:24,764 INFO L124 PetriNetUnfolderBase]: 12942/33759 cut-off events. [2025-02-08 05:29:24,764 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-02-08 05:29:24,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53372 conditions, 33759 events. 12942/33759 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 359222 event pairs, 11942 based on Foata normal form. 872/31905 useless extension candidates. Maximal degree in co-relation 53044. Up to 19532 conditions per place. [2025-02-08 05:29:25,017 INFO L140 encePairwiseOnDemand]: 262/270 looper letters, 68 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2025-02-08 05:29:25,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 259 transitions, 673 flow [2025-02-08 05:29:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1234 transitions. [2025-02-08 05:29:25,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7617283950617284 [2025-02-08 05:29:25,045 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 533 flow. Second operand 6 states and 1234 transitions. [2025-02-08 05:29:25,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 259 transitions, 673 flow [2025-02-08 05:29:25,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 259 transitions, 668 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:29:25,058 INFO L231 Difference]: Finished difference. Result has 264 places, 259 transitions, 532 flow [2025-02-08 05:29:25,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=264, PETRI_TRANSITIONS=259} [2025-02-08 05:29:25,066 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 1 predicate places. [2025-02-08 05:29:25,066 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 259 transitions, 532 flow [2025-02-08 05:29:25,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 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:29:25,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:25,067 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] [2025-02-08 05:29:25,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:29:25,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -173424023, now seen corresponding path program 1 times [2025-02-08 05:29:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966297108] [2025-02-08 05:29:25,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:25,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:29:25,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:29:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:25,439 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:29:25,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:25,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966297108] [2025-02-08 05:29:25,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966297108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:25,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:25,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:25,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117693098] [2025-02-08 05:29:25,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:25,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:25,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:25,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:25,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 270 [2025-02-08 05:29:25,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 259 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 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:29:25,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:25,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 270 [2025-02-08 05:29:25,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:29,783 INFO L124 PetriNetUnfolderBase]: 12942/33758 cut-off events. [2025-02-08 05:29:29,783 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-02-08 05:29:29,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53321 conditions, 33758 events. 12942/33758 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 359410 event pairs, 11942 based on Foata normal form. 0/31033 useless extension candidates. Maximal degree in co-relation 53262. Up to 19532 conditions per place. [2025-02-08 05:29:29,981 INFO L140 encePairwiseOnDemand]: 264/270 looper letters, 68 selfloop transitions, 5 changer transitions 0/258 dead transitions. [2025-02-08 05:29:29,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 258 transitions, 676 flow [2025-02-08 05:29:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1232 transitions. [2025-02-08 05:29:29,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604938271604939 [2025-02-08 05:29:29,989 INFO L175 Difference]: Start difference. First operand has 264 places, 259 transitions, 532 flow. Second operand 6 states and 1232 transitions. [2025-02-08 05:29:29,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 258 transitions, 676 flow [2025-02-08 05:29:29,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 258 transitions, 666 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:29:29,999 INFO L231 Difference]: Finished difference. Result has 263 places, 258 transitions, 530 flow [2025-02-08 05:29:30,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=530, PETRI_PLACES=263, PETRI_TRANSITIONS=258} [2025-02-08 05:29:30,003 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 0 predicate places. [2025-02-08 05:29:30,003 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 258 transitions, 530 flow [2025-02-08 05:29:30,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 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:29:30,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:30,005 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] [2025-02-08 05:29:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:29:30,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting writer_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -912484431, now seen corresponding path program 1 times [2025-02-08 05:29:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837820709] [2025-02-08 05:29:30,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:30,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:30,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:29:30,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:29:30,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:30,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:30,578 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:29:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837820709] [2025-02-08 05:29:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837820709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022529329] [2025-02-08 05:29:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:30,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:30,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:30,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:31,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 270 [2025-02-08 05:29:31,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 258 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 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:29:31,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:31,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 270 [2025-02-08 05:29:31,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:31,707 INFO L124 PetriNetUnfolderBase]: 698/3066 cut-off events. [2025-02-08 05:29:31,707 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 05:29:31,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 3066 events. 698/3066 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 24454 event pairs, 187 based on Foata normal form. 0/2792 useless extension candidates. Maximal degree in co-relation 4334. Up to 903 conditions per place. [2025-02-08 05:29:31,744 INFO L140 encePairwiseOnDemand]: 242/270 looper letters, 70 selfloop transitions, 49 changer transitions 0/324 dead transitions. [2025-02-08 05:29:31,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 324 transitions, 904 flow [2025-02-08 05:29:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1406 transitions. [2025-02-08 05:29:31,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679012345679012 [2025-02-08 05:29:31,748 INFO L175 Difference]: Start difference. First operand has 263 places, 258 transitions, 530 flow. Second operand 6 states and 1406 transitions. [2025-02-08 05:29:31,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 324 transitions, 904 flow [2025-02-08 05:29:31,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 324 transitions, 894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:29:31,756 INFO L231 Difference]: Finished difference. Result has 268 places, 306 transitions, 866 flow [2025-02-08 05:29:31,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=268, PETRI_TRANSITIONS=306} [2025-02-08 05:29:31,758 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2025-02-08 05:29:31,758 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 306 transitions, 866 flow [2025-02-08 05:29:31,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 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:29:31,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:31,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:31,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:29:31,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr9ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:31,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1580083798, now seen corresponding path program 1 times [2025-02-08 05:29:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161894414] [2025-02-08 05:29:31,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:31,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:29:31,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:29:31,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:31,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:32,201 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:29:32,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161894414] [2025-02-08 05:29:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161894414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:32,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:32,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694013053] [2025-02-08 05:29:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:32,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:32,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:32,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:32,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 270 [2025-02-08 05:29:32,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 306 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 230.66666666666666) internal successors, (1384), 6 states have internal predecessors, (1384), 0 states have call successors, (0), 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:29:32,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:32,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 270 [2025-02-08 05:29:32,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:35,886 INFO L124 PetriNetUnfolderBase]: 7529/28033 cut-off events. [2025-02-08 05:29:35,886 INFO L125 PetriNetUnfolderBase]: For 8452/8928 co-relation queries the response was YES. [2025-02-08 05:29:35,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49493 conditions, 28033 events. 7529/28033 cut-off events. For 8452/8928 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 338810 event pairs, 1412 based on Foata normal form. 66/25534 useless extension candidates. Maximal degree in co-relation 44758. Up to 8434 conditions per place. [2025-02-08 05:29:36,103 INFO L140 encePairwiseOnDemand]: 248/270 looper letters, 92 selfloop transitions, 205 changer transitions 0/530 dead transitions. [2025-02-08 05:29:36,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 530 transitions, 2540 flow [2025-02-08 05:29:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1496 transitions. [2025-02-08 05:29:36,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9234567901234568 [2025-02-08 05:29:36,108 INFO L175 Difference]: Start difference. First operand has 268 places, 306 transitions, 866 flow. Second operand 6 states and 1496 transitions. [2025-02-08 05:29:36,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 530 transitions, 2540 flow [2025-02-08 05:29:36,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 530 transitions, 2540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:36,161 INFO L231 Difference]: Finished difference. Result has 278 places, 510 transitions, 2828 flow [2025-02-08 05:29:36,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2828, PETRI_PLACES=278, PETRI_TRANSITIONS=510} [2025-02-08 05:29:36,163 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2025-02-08 05:29:36,164 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 510 transitions, 2828 flow [2025-02-08 05:29:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.66666666666666) internal successors, (1384), 6 states have internal predecessors, (1384), 0 states have call successors, (0), 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:29:36,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:29:36,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:36,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1080459574, now seen corresponding path program 1 times [2025-02-08 05:29:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327959693] [2025-02-08 05:29:36,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:36,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:36,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:29:36,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:29:36,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:36,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327959693] [2025-02-08 05:29:36,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327959693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478644396] [2025-02-08 05:29:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:36,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:36,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:36,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:37,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 270 [2025-02-08 05:29:37,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 510 transitions, 2828 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 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:29:37,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:37,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 270 [2025-02-08 05:29:37,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:41,862 INFO L124 PetriNetUnfolderBase]: 10743/38735 cut-off events. [2025-02-08 05:29:41,863 INFO L125 PetriNetUnfolderBase]: For 43940/47315 co-relation queries the response was YES. [2025-02-08 05:29:41,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86761 conditions, 38735 events. 10743/38735 cut-off events. For 43940/47315 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 495182 event pairs, 888 based on Foata normal form. 1226/36993 useless extension candidates. Maximal degree in co-relation 86680. Up to 11660 conditions per place. [2025-02-08 05:29:42,137 INFO L140 encePairwiseOnDemand]: 242/270 looper letters, 300 selfloop transitions, 265 changer transitions 0/788 dead transitions. [2025-02-08 05:29:42,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 788 transitions, 5834 flow [2025-02-08 05:29:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1402 transitions. [2025-02-08 05:29:42,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8654320987654321 [2025-02-08 05:29:42,144 INFO L175 Difference]: Start difference. First operand has 278 places, 510 transitions, 2828 flow. Second operand 6 states and 1402 transitions. [2025-02-08 05:29:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 788 transitions, 5834 flow [2025-02-08 05:29:42,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 788 transitions, 5834 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:42,247 INFO L231 Difference]: Finished difference. Result has 288 places, 774 transitions, 5970 flow [2025-02-08 05:29:42,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=2828, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5970, PETRI_PLACES=288, PETRI_TRANSITIONS=774} [2025-02-08 05:29:42,249 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 25 predicate places. [2025-02-08 05:29:42,249 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 774 transitions, 5970 flow [2025-02-08 05:29:42,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 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:29:42,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:42,250 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] [2025-02-08 05:29:42,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:29:42,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting writer_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:42,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2122344841, now seen corresponding path program 1 times [2025-02-08 05:29:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727487119] [2025-02-08 05:29:42,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:42,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:42,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:29:42,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:29:42,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:42,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727487119] [2025-02-08 05:29:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727487119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451259325] [2025-02-08 05:29:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:42,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:42,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:43,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 270 [2025-02-08 05:29:43,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 774 transitions, 5970 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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:29:43,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:43,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 270 [2025-02-08 05:29:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:48,849 INFO L124 PetriNetUnfolderBase]: 12549/43856 cut-off events. [2025-02-08 05:29:48,850 INFO L125 PetriNetUnfolderBase]: For 112236/124923 co-relation queries the response was YES. [2025-02-08 05:29:49,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113316 conditions, 43856 events. 12549/43856 cut-off events. For 112236/124923 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 566061 event pairs, 772 based on Foata normal form. 2557/43365 useless extension candidates. Maximal degree in co-relation 113230. Up to 11298 conditions per place. [2025-02-08 05:29:49,499 INFO L140 encePairwiseOnDemand]: 255/270 looper letters, 414 selfloop transitions, 510 changer transitions 0/1299 dead transitions. [2025-02-08 05:29:49,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1299 transitions, 13000 flow [2025-02-08 05:29:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1476 transitions. [2025-02-08 05:29:49,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2025-02-08 05:29:49,503 INFO L175 Difference]: Start difference. First operand has 288 places, 774 transitions, 5970 flow. Second operand 6 states and 1476 transitions. [2025-02-08 05:29:49,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 1299 transitions, 13000 flow [2025-02-08 05:29:49,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 1299 transitions, 13000 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:49,657 INFO L231 Difference]: Finished difference. Result has 298 places, 1284 transitions, 13640 flow [2025-02-08 05:29:49,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=5970, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13640, PETRI_PLACES=298, PETRI_TRANSITIONS=1284} [2025-02-08 05:29:49,659 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 35 predicate places. [2025-02-08 05:29:49,659 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 1284 transitions, 13640 flow [2025-02-08 05:29:49,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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:29:49,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:49,660 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] [2025-02-08 05:29:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:29:49,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr8ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:49,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash -991396263, now seen corresponding path program 1 times [2025-02-08 05:29:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118577588] [2025-02-08 05:29:49,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:49,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:29:49,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:29:49,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:49,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118577588] [2025-02-08 05:29:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118577588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:49,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295642177] [2025-02-08 05:29:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:49,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:49,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:49,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:50,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 270 [2025-02-08 05:29:50,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 1284 transitions, 13640 flow. Second operand has 6 states, 6 states have (on average 230.66666666666666) internal successors, (1384), 6 states have internal predecessors, (1384), 0 states have call successors, (0), 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:29:50,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:50,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 270 [2025-02-08 05:29:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand