./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:55,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:55,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:39:55,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:55,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:55,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:55,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:55,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:55,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:55,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:55,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:55,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:55,108 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:55,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:55,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:55,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:55,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:55,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:55,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:55,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:55,110 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-02-08 05:39:55,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:55,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:55,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:55,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:55,356 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:55,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 05:39:56,728 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d528eebb/a3a4e16fff29448d915ff9f62b0a3e6e/FLAG4d3b77bcd [2025-02-08 05:39:56,950 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:56,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 05:39:56,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d528eebb/a3a4e16fff29448d915ff9f62b0a3e6e/FLAG4d3b77bcd [2025-02-08 05:39:57,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d528eebb/a3a4e16fff29448d915ff9f62b0a3e6e [2025-02-08 05:39:57,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:57,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:57,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:57,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:57,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:57,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637fae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57, skipping insertion in model container [2025-02-08 05:39:57,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:57,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:57,478 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:57,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:57,522 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:57,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57 WrapperNode [2025-02-08 05:39:57,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:57,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:57,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:57,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:57,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,578 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 372 [2025-02-08 05:39:57,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:57,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:57,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:57,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:57,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:57,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:57,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:57,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:57,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (1/1) ... [2025-02-08 05:39:57,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:57,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:57,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:39:57,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:39:57,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:57,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:57,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:57,676 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:57,676 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:57,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:57,677 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:39:57,750 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:57,752 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:57,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-2: havoc #t~post4#1; [2025-02-08 05:39:57,886 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-3: ~i~0#1 := 1 + #t~post4#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-4: #t~post4#1 := ~i~0#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51: havoc #t~nondet3#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-1: havoc #t~ret2#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: assume #race~asum~0 == #t~nondet3#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: assume !(#race~asum~0 == #t~nondet3#1); [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-3: havoc #t~mem1#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-4: #race~asum~0 := #t~nondet3#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-5: havoc #t~nondet3#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-6: ~asum~0 := #t~ret2#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:57,887 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-10: #t~ret2#1 := plus_#res#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: havoc #t~post8#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: ~i~1#1 := 1 + #t~post8#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: #t~post8#1 := ~i~1#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~nondet7#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: havoc #t~ret6#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: assume #race~bsum~0 == #t~nondet7#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: assume !(#race~bsum~0 == #t~nondet7#1); [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-3: havoc #t~mem5#1; [2025-02-08 05:39:57,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-4: #race~bsum~0 := #t~nondet7#1; [2025-02-08 05:39:57,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-5: havoc #t~nondet7#1; [2025-02-08 05:39:57,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-6: ~bsum~0 := #t~ret6#1; [2025-02-08 05:39:57,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:39:57,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:57,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:57,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-10: #t~ret6#1 := plus_#res#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: havoc #t~mem13#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: #race~csum~0 := #t~nondet15#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: havoc #t~nondet15#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: ~csum~0 := #t~ret14#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: #t~ret14#1 := plus_#res#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-12: havoc plus_#res#1; [2025-02-08 05:39:58,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-13: assume ((0 == #race[~C~0.base,~C~0.offset + 4 * ~i~2#1] && 0 == #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~2#1)]) && 0 == #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~2#1)]) && 0 == #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~2#1)]; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-13: assume !(((0 == #race[~C~0.base,~C~0.offset + 4 * ~i~2#1] && 0 == #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~2#1)]) && 0 == #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~2#1)]) && 0 == #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~2#1)]); [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-14: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~csum~0, #t~mem13#1; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-15: #race := #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~2#1) := 0]; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-16: #race := #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~2#1) := 0]; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-17: #race := #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~2#1) := 0]; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-18: #race := #race[~C~0.base,~C~0.offset + 4 * ~i~2#1 := 0]; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-19: SUMMARY for call #t~mem13#1 := read~int(~C~0.base, ~C~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-20: assume 0 == #race~C~0; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-20: assume !(0 == #race~C~0); [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-21: assume 0 == #race~csum~0; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-21: assume !(0 == #race~csum~0); [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-22: #race~C~0 := 0; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-23: #race~csum~0 := 0; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:58,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-1: assume false; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-3: assume false; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~post16#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: ~i~2#1 := 1 + #t~post16#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: #t~post16#1 := ~i~2#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: havoc #t~nondet12#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-1: havoc #t~ret11#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-2: havoc #t~mem10#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: assume ((#race[~C~0.base,~C~0.offset + 4 * ~i~2#1] == #t~nondet12#1 && #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~2#1)] == #t~nondet12#1) && #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~2#1)] == #t~nondet12#1) && #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~2#1)] == #t~nondet12#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: assume !(((#race[~C~0.base,~C~0.offset + 4 * ~i~2#1] == #t~nondet12#1 && #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~2#1)] == #t~nondet12#1) && #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~2#1)] == #t~nondet12#1) && #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~2#1)] == #t~nondet12#1); [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-4: havoc #t~mem9#1; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-5: #race := #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~2#1) := #t~nondet12#1]; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-6: #race := #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~2#1) := #t~nondet12#1]; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-7: #race := #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~2#1) := #t~nondet12#1]; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-8: #race := #race[~C~0.base,~C~0.offset + 4 * ~i~2#1 := #t~nondet12#1]; [2025-02-08 05:39:58,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-9: havoc #t~nondet12#1; [2025-02-08 05:39:58,135 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-10: SUMMARY for call write~int(#t~ret11#1, ~C~0.base, ~C~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-11: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-12: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-13: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-14: #t~ret11#1 := plus_#res#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~nondet15#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~ret14#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: assume #race~csum~0 == #t~nondet15#1; [2025-02-08 05:39:58,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: assume !(#race~csum~0 == #t~nondet15#1); [2025-02-08 05:39:58,334 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:58,334 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:58,349 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:58,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:58,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:58 BoogieIcfgContainer [2025-02-08 05:39:58,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:58,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:58,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:58,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:58,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:57" (1/3) ... [2025-02-08 05:39:58,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6597f014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:58, skipping insertion in model container [2025-02-08 05:39:58,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:57" (2/3) ... [2025-02-08 05:39:58,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6597f014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:58, skipping insertion in model container [2025-02-08 05:39:58,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:58" (3/3) ... [2025-02-08 05:39:58,357 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 05:39:58,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:58,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 399 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-02-08 05:39:58,368 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:58,447 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:39:58,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 408 places, 419 transitions, 859 flow [2025-02-08 05:39:58,584 INFO L124 PetriNetUnfolderBase]: 21/416 cut-off events. [2025-02-08 05:39:58,585 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:39:58,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 416 events. 21/416 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 664 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 306. Up to 2 conditions per place. [2025-02-08 05:39:58,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 408 places, 419 transitions, 859 flow [2025-02-08 05:39:58,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 364 places, 372 transitions, 762 flow [2025-02-08 05:39:58,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:58,613 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;@35dc1f52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:58,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-08 05:39:58,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:58,619 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:39:58,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:58,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,620 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] [2025-02-08 05:39:58,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:39:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1266699347, now seen corresponding path program 1 times [2025-02-08 05:39:58,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755909439] [2025-02-08 05:39:58,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:39:58,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:39:58,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755909439] [2025-02-08 05:39:58,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755909439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096015652] [2025-02-08 05:39:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 419 [2025-02-08 05:39:58,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 372 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 419 [2025-02-08 05:39:58,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,974 INFO L124 PetriNetUnfolderBase]: 18/783 cut-off events. [2025-02-08 05:39:58,974 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:39:58,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 783 events. 18/783 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3850 event pairs, 15 based on Foata normal form. 32/697 useless extension candidates. Maximal degree in co-relation 571. Up to 43 conditions per place. [2025-02-08 05:39:58,985 INFO L140 encePairwiseOnDemand]: 401/419 looper letters, 15 selfloop transitions, 2 changer transitions 6/356 dead transitions. [2025-02-08 05:39:58,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 356 transitions, 764 flow [2025-02-08 05:39:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-02-08 05:39:58,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9355608591885441 [2025-02-08 05:39:59,000 INFO L175 Difference]: Start difference. First operand has 364 places, 372 transitions, 762 flow. Second operand 3 states and 1176 transitions. [2025-02-08 05:39:59,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 356 transitions, 764 flow [2025-02-08 05:39:59,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 356 transitions, 752 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:39:59,012 INFO L231 Difference]: Finished difference. Result has 359 places, 350 transitions, 710 flow [2025-02-08 05:39:59,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=359, PETRI_TRANSITIONS=350} [2025-02-08 05:39:59,018 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -5 predicate places. [2025-02-08 05:39:59,018 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 350 transitions, 710 flow [2025-02-08 05:39:59,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:59,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:59,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:39:59,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1108879368, now seen corresponding path program 1 times [2025-02-08 05:39:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289055622] [2025-02-08 05:39:59,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:39:59,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:39:59,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289055622] [2025-02-08 05:39:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289055622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322825122] [2025-02-08 05:39:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 419 [2025-02-08 05:39:59,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 350 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 419 [2025-02-08 05:39:59,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,351 INFO L124 PetriNetUnfolderBase]: 59/1548 cut-off events. [2025-02-08 05:39:59,352 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:39:59,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1548 events. 59/1548 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 11389 event pairs, 56 based on Foata normal form. 0/1327 useless extension candidates. Maximal degree in co-relation 1649. Up to 114 conditions per place. [2025-02-08 05:39:59,362 INFO L140 encePairwiseOnDemand]: 412/419 looper letters, 18 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2025-02-08 05:39:59,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 344 transitions, 736 flow [2025-02-08 05:39:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-02-08 05:39:59,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148766905330151 [2025-02-08 05:39:59,367 INFO L175 Difference]: Start difference. First operand has 359 places, 350 transitions, 710 flow. Second operand 3 states and 1150 transitions. [2025-02-08 05:39:59,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 344 transitions, 736 flow [2025-02-08 05:39:59,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 344 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:59,373 INFO L231 Difference]: Finished difference. Result has 347 places, 344 transitions, 696 flow [2025-02-08 05:39:59,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=347, PETRI_TRANSITIONS=344} [2025-02-08 05:39:59,374 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -17 predicate places. [2025-02-08 05:39:59,375 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 344 transitions, 696 flow [2025-02-08 05:39:59,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,376 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] [2025-02-08 05:39:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:59,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:39:59,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -560915135, now seen corresponding path program 1 times [2025-02-08 05:39:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050931396] [2025-02-08 05:39:59,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:39:59,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:39:59,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050931396] [2025-02-08 05:39:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050931396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846565101] [2025-02-08 05:39:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:59,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:00,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2025-02-08 05:40:00,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 344 transitions, 696 flow. Second operand has 6 states, 6 states have (on average 337.5) internal successors, (2025), 6 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2025-02-08 05:40:00,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,522 INFO L124 PetriNetUnfolderBase]: 467/2492 cut-off events. [2025-02-08 05:40:00,523 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 05:40:00,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 2492 events. 467/2492 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 20412 event pairs, 464 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 3309. Up to 799 conditions per place. [2025-02-08 05:40:00,541 INFO L140 encePairwiseOnDemand]: 401/419 looper letters, 46 selfloop transitions, 15 changer transitions 0/341 dead transitions. [2025-02-08 05:40:00,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 341 transitions, 812 flow [2025-02-08 05:40:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2080 transitions. [2025-02-08 05:40:00,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273667462211615 [2025-02-08 05:40:00,548 INFO L175 Difference]: Start difference. First operand has 347 places, 344 transitions, 696 flow. Second operand 6 states and 2080 transitions. [2025-02-08 05:40:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 341 transitions, 812 flow [2025-02-08 05:40:00,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 341 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:00,554 INFO L231 Difference]: Finished difference. Result has 348 places, 341 transitions, 719 flow [2025-02-08 05:40:00,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=348, PETRI_TRANSITIONS=341} [2025-02-08 05:40:00,555 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -16 predicate places. [2025-02-08 05:40:00,555 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 341 transitions, 719 flow [2025-02-08 05:40:00,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 337.5) internal successors, (2025), 6 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,557 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] [2025-02-08 05:40:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:00,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash 433703138, now seen corresponding path program 1 times [2025-02-08 05:40:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972544895] [2025-02-08 05:40:00,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:40:00,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:40:00,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972544895] [2025-02-08 05:40:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972544895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885772930] [2025-02-08 05:40:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:00,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:00,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 419 [2025-02-08 05:40:00,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 341 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 419 [2025-02-08 05:40:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,654 INFO L124 PetriNetUnfolderBase]: 8/450 cut-off events. [2025-02-08 05:40:00,655 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:00,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 450 events. 8/450 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1249 event pairs, 5 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 465. Up to 22 conditions per place. [2025-02-08 05:40:00,657 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 11 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-02-08 05:40:00,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 340 transitions, 743 flow [2025-02-08 05:40:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1169 transitions. [2025-02-08 05:40:00,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9299920445505171 [2025-02-08 05:40:00,660 INFO L175 Difference]: Start difference. First operand has 348 places, 341 transitions, 719 flow. Second operand 3 states and 1169 transitions. [2025-02-08 05:40:00,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 340 transitions, 743 flow [2025-02-08 05:40:00,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 340 transitions, 713 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:00,665 INFO L231 Difference]: Finished difference. Result has 344 places, 340 transitions, 691 flow [2025-02-08 05:40:00,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=344, PETRI_TRANSITIONS=340} [2025-02-08 05:40:00,666 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -20 predicate places. [2025-02-08 05:40:00,666 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 340 transitions, 691 flow [2025-02-08 05:40:00,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:00,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:00,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1519042008, now seen corresponding path program 1 times [2025-02-08 05:40:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797286982] [2025-02-08 05:40:00,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:40:00,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:40:00,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797286982] [2025-02-08 05:40:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797286982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918864059] [2025-02-08 05:40:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:00,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 419 [2025-02-08 05:40:00,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 340 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 419 [2025-02-08 05:40:00,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,836 INFO L124 PetriNetUnfolderBase]: 10/405 cut-off events. [2025-02-08 05:40:00,836 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:00,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 405 events. 10/405 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 974 event pairs, 7 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 409. Up to 25 conditions per place. [2025-02-08 05:40:00,838 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 11 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-02-08 05:40:00,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 339 transitions, 715 flow [2025-02-08 05:40:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1169 transitions. [2025-02-08 05:40:00,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9299920445505171 [2025-02-08 05:40:00,841 INFO L175 Difference]: Start difference. First operand has 344 places, 340 transitions, 691 flow. Second operand 3 states and 1169 transitions. [2025-02-08 05:40:00,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 339 transitions, 715 flow [2025-02-08 05:40:00,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:00,846 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 689 flow [2025-02-08 05:40:00,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-02-08 05:40:00,846 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -21 predicate places. [2025-02-08 05:40:00,846 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 689 flow [2025-02-08 05:40:00,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:00,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:00,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 884035701, now seen corresponding path program 1 times [2025-02-08 05:40:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172606613] [2025-02-08 05:40:00,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:40:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:40:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172606613] [2025-02-08 05:40:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172606613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857234626] [2025-02-08 05:40:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:00,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:00,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 419 [2025-02-08 05:40:00,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 419 [2025-02-08 05:40:00,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:01,011 INFO L124 PetriNetUnfolderBase]: 5/342 cut-off events. [2025-02-08 05:40:01,015 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 342 events. 5/342 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 608 event pairs, 2 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 335. Up to 15 conditions per place. [2025-02-08 05:40:01,017 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 10 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2025-02-08 05:40:01,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 338 transitions, 711 flow [2025-02-08 05:40:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1171 transitions. [2025-02-08 05:40:01,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315831344470963 [2025-02-08 05:40:01,024 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 689 flow. Second operand 3 states and 1171 transitions. [2025-02-08 05:40:01,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 338 transitions, 711 flow [2025-02-08 05:40:01,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 338 transitions, 707 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:01,032 INFO L231 Difference]: Finished difference. Result has 342 places, 338 transitions, 687 flow [2025-02-08 05:40:01,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=342, PETRI_TRANSITIONS=338} [2025-02-08 05:40:01,037 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -22 predicate places. [2025-02-08 05:40:01,037 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 338 transitions, 687 flow [2025-02-08 05:40:01,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:01,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:01,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1772813237, now seen corresponding path program 1 times [2025-02-08 05:40:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200695100] [2025-02-08 05:40:01,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:01,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:40:01,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:40:01,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:01,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200695100] [2025-02-08 05:40:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200695100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058005375] [2025-02-08 05:40:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:01,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:01,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 419 [2025-02-08 05:40:01,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 338 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:01,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 419 [2025-02-08 05:40:01,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:01,157 INFO L124 PetriNetUnfolderBase]: 7/404 cut-off events. [2025-02-08 05:40:01,157 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:01,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 404 events. 7/404 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 987 event pairs, 0 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 404. Up to 12 conditions per place. [2025-02-08 05:40:01,159 INFO L140 encePairwiseOnDemand]: 415/419 looper letters, 10 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2025-02-08 05:40:01,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 338 transitions, 713 flow [2025-02-08 05:40:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-02-08 05:40:01,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371519490851233 [2025-02-08 05:40:01,161 INFO L175 Difference]: Start difference. First operand has 342 places, 338 transitions, 687 flow. Second operand 3 states and 1178 transitions. [2025-02-08 05:40:01,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 338 transitions, 713 flow [2025-02-08 05:40:01,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 338 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:01,165 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 683 flow [2025-02-08 05:40:01,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-02-08 05:40:01,165 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -24 predicate places. [2025-02-08 05:40:01,166 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 683 flow [2025-02-08 05:40:01,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:01,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:01,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:01,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1428466442, now seen corresponding path program 1 times [2025-02-08 05:40:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109130282] [2025-02-08 05:40:01,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:01,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 05:40:01,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 05:40:01,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:01,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109130282] [2025-02-08 05:40:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109130282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531293349] [2025-02-08 05:40:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:01,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:01,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 419 [2025-02-08 05:40:01,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:01,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 419 [2025-02-08 05:40:01,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:01,266 INFO L124 PetriNetUnfolderBase]: 15/587 cut-off events. [2025-02-08 05:40:01,266 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:40:01,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 587 events. 15/587 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2105 event pairs, 2 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 604. Up to 28 conditions per place. [2025-02-08 05:40:01,269 INFO L140 encePairwiseOnDemand]: 415/419 looper letters, 15 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-02-08 05:40:01,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 340 transitions, 729 flow [2025-02-08 05:40:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions. [2025-02-08 05:40:01,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387430389817024 [2025-02-08 05:40:01,271 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 683 flow. Second operand 3 states and 1180 transitions. [2025-02-08 05:40:01,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 340 transitions, 729 flow [2025-02-08 05:40:01,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:01,281 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 691 flow [2025-02-08 05:40:01,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-02-08 05:40:01,285 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -24 predicate places. [2025-02-08 05:40:01,285 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 691 flow [2025-02-08 05:40:01,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:01,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:01,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:01,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:01,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1952944803, now seen corresponding path program 1 times [2025-02-08 05:40:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579978160] [2025-02-08 05:40:01,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:01,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:40:01,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:40:01,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:01,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579978160] [2025-02-08 05:40:01,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579978160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:01,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870302976] [2025-02-08 05:40:01,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:01,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:01,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:01,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 419 [2025-02-08 05:40:01,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:01,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 419 [2025-02-08 05:40:01,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:01,408 INFO L124 PetriNetUnfolderBase]: 8/440 cut-off events. [2025-02-08 05:40:01,409 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:01,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 440 events. 8/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1136 event pairs, 0 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 443. Up to 11 conditions per place. [2025-02-08 05:40:01,411 INFO L140 encePairwiseOnDemand]: 415/419 looper letters, 9 selfloop transitions, 1 changer transitions 4/336 dead transitions. [2025-02-08 05:40:01,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 336 transitions, 715 flow [2025-02-08 05:40:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2025-02-08 05:40:01,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9363564041368337 [2025-02-08 05:40:01,413 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 691 flow. Second operand 3 states and 1177 transitions. [2025-02-08 05:40:01,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 336 transitions, 715 flow [2025-02-08 05:40:01,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 336 transitions, 715 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:01,417 INFO L231 Difference]: Finished difference. Result has 340 places, 330 transitions, 680 flow [2025-02-08 05:40:01,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=340, PETRI_TRANSITIONS=330} [2025-02-08 05:40:01,418 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -24 predicate places. [2025-02-08 05:40:01,418 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 330 transitions, 680 flow [2025-02-08 05:40:01,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:01,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:01,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 120783454, now seen corresponding path program 1 times [2025-02-08 05:40:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536288988] [2025-02-08 05:40:01,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:01,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:40:01,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:40:01,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:01,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536288988] [2025-02-08 05:40:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536288988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460887143] [2025-02-08 05:40:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:01,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:01,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 419 [2025-02-08 05:40:01,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 330 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 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:40:01,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:01,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 419 [2025-02-08 05:40:01,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:01,551 INFO L124 PetriNetUnfolderBase]: 28/760 cut-off events. [2025-02-08 05:40:01,551 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:40:01,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 760 events. 28/760 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3570 event pairs, 6 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 803. Up to 50 conditions per place. [2025-02-08 05:40:01,556 INFO L140 encePairwiseOnDemand]: 415/419 looper letters, 14 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2025-02-08 05:40:01,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 333 transitions, 721 flow [2025-02-08 05:40:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-02-08 05:40:01,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9379474940334129 [2025-02-08 05:40:01,559 INFO L175 Difference]: Start difference. First operand has 340 places, 330 transitions, 680 flow. Second operand 3 states and 1179 transitions. [2025-02-08 05:40:01,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 333 transitions, 721 flow [2025-02-08 05:40:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 333 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:01,565 INFO L231 Difference]: Finished difference. Result has 336 places, 330 transitions, 689 flow [2025-02-08 05:40:01,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=336, PETRI_TRANSITIONS=330} [2025-02-08 05:40:01,566 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -28 predicate places. [2025-02-08 05:40:01,566 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 330 transitions, 689 flow [2025-02-08 05:40:01,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 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:40:01,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:01,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:01,567 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:01,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1881931495, now seen corresponding path program 1 times [2025-02-08 05:40:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:01,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882993302] [2025-02-08 05:40:01,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:01,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:40:01,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:40:01,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:01,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882993302] [2025-02-08 05:40:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882993302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:01,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:40:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146002667] [2025-02-08 05:40:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:01,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:40:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:01,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:40:01,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:40:01,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 419 [2025-02-08 05:40:01,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 330 transitions, 689 flow. Second operand has 7 states, 7 states have (on average 366.14285714285717) internal successors, (2563), 7 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:01,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:01,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 419 [2025-02-08 05:40:01,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:02,148 INFO L124 PetriNetUnfolderBase]: 24/1026 cut-off events. [2025-02-08 05:40:02,149 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:02,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 1026 events. 24/1026 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4257 event pairs, 6 based on Foata normal form. 3/966 useless extension candidates. Maximal degree in co-relation 1156. Up to 26 conditions per place. [2025-02-08 05:40:02,154 INFO L140 encePairwiseOnDemand]: 390/419 looper letters, 39 selfloop transitions, 42 changer transitions 0/373 dead transitions. [2025-02-08 05:40:02,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 373 transitions, 945 flow [2025-02-08 05:40:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:40:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:40:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3702 transitions. [2025-02-08 05:40:02,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8835322195704057 [2025-02-08 05:40:02,160 INFO L175 Difference]: Start difference. First operand has 336 places, 330 transitions, 689 flow. Second operand 10 states and 3702 transitions. [2025-02-08 05:40:02,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 373 transitions, 945 flow [2025-02-08 05:40:02,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 373 transitions, 945 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:02,164 INFO L231 Difference]: Finished difference. Result has 349 places, 355 transitions, 881 flow [2025-02-08 05:40:02,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=881, PETRI_PLACES=349, PETRI_TRANSITIONS=355} [2025-02-08 05:40:02,165 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -15 predicate places. [2025-02-08 05:40:02,165 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 355 transitions, 881 flow [2025-02-08 05:40:02,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 366.14285714285717) internal successors, (2563), 7 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:02,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:02,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:02,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1517134911, now seen corresponding path program 1 times [2025-02-08 05:40:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:02,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399877072] [2025-02-08 05:40:02,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:02,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:02,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:40:02,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:40:02,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:02,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399877072] [2025-02-08 05:40:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399877072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082064840] [2025-02-08 05:40:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:02,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:02,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:02,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 419 [2025-02-08 05:40:02,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 355 transitions, 881 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:02,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 419 [2025-02-08 05:40:02,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:02,292 INFO L124 PetriNetUnfolderBase]: 22/949 cut-off events. [2025-02-08 05:40:02,292 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:02,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 949 events. 22/949 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3519 event pairs, 0 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1084. Up to 20 conditions per place. [2025-02-08 05:40:02,297 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 10 selfloop transitions, 1 changer transitions 0/356 dead transitions. [2025-02-08 05:40:02,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 356 transitions, 907 flow [2025-02-08 05:40:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-02-08 05:40:02,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9403341288782816 [2025-02-08 05:40:02,327 INFO L175 Difference]: Start difference. First operand has 349 places, 355 transitions, 881 flow. Second operand 3 states and 1182 transitions. [2025-02-08 05:40:02,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 356 transitions, 907 flow [2025-02-08 05:40:02,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 356 transitions, 907 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:02,332 INFO L231 Difference]: Finished difference. Result has 350 places, 354 transitions, 881 flow [2025-02-08 05:40:02,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=881, PETRI_PLACES=350, PETRI_TRANSITIONS=354} [2025-02-08 05:40:02,333 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -14 predicate places. [2025-02-08 05:40:02,333 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 354 transitions, 881 flow [2025-02-08 05:40:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:02,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:02,334 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1939521985, now seen corresponding path program 1 times [2025-02-08 05:40:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959180363] [2025-02-08 05:40:02,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:02,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:40:02,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:40:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959180363] [2025-02-08 05:40:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959180363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:02,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:40:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624250578] [2025-02-08 05:40:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:40:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:02,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:40:02,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:40:02,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 419 [2025-02-08 05:40:02,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 354 transitions, 881 flow. Second operand has 7 states, 7 states have (on average 366.2857142857143) internal successors, (2564), 7 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:02,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 419 [2025-02-08 05:40:02,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:02,855 INFO L124 PetriNetUnfolderBase]: 22/791 cut-off events. [2025-02-08 05:40:02,855 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:40:02,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 791 events. 22/791 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2474 event pairs, 8 based on Foata normal form. 3/760 useless extension candidates. Maximal degree in co-relation 979. Up to 26 conditions per place. [2025-02-08 05:40:02,860 INFO L140 encePairwiseOnDemand]: 390/419 looper letters, 39 selfloop transitions, 42 changer transitions 0/374 dead transitions. [2025-02-08 05:40:02,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 374 transitions, 1111 flow [2025-02-08 05:40:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:40:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:40:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3702 transitions. [2025-02-08 05:40:02,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8835322195704057 [2025-02-08 05:40:02,866 INFO L175 Difference]: Start difference. First operand has 350 places, 354 transitions, 881 flow. Second operand 10 states and 3702 transitions. [2025-02-08 05:40:02,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 374 transitions, 1111 flow [2025-02-08 05:40:02,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 374 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:02,873 INFO L231 Difference]: Finished difference. Result has 360 places, 356 transitions, 985 flow [2025-02-08 05:40:02,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=985, PETRI_PLACES=360, PETRI_TRANSITIONS=356} [2025-02-08 05:40:02,874 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -4 predicate places. [2025-02-08 05:40:02,874 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 356 transitions, 985 flow [2025-02-08 05:40:02,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 366.2857142857143) internal successors, (2564), 7 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:02,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:02,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:02,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1955364059, now seen corresponding path program 1 times [2025-02-08 05:40:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001750467] [2025-02-08 05:40:02,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:02,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:40:02,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:40:02,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:02,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:03,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:03,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001750467] [2025-02-08 05:40:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001750467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:03,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:03,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:40:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070802312] [2025-02-08 05:40:03,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:03,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:40:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:03,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:40:03,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:40:03,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 419 [2025-02-08 05:40:03,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 356 transitions, 985 flow. Second operand has 7 states, 7 states have (on average 366.42857142857144) internal successors, (2565), 7 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:03,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 419 [2025-02-08 05:40:03,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:03,579 INFO L124 PetriNetUnfolderBase]: 23/754 cut-off events. [2025-02-08 05:40:03,579 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-02-08 05:40:03,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 754 events. 23/754 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2304 event pairs, 6 based on Foata normal form. 3/729 useless extension candidates. Maximal degree in co-relation 982. Up to 26 conditions per place. [2025-02-08 05:40:03,583 INFO L140 encePairwiseOnDemand]: 390/419 looper letters, 39 selfloop transitions, 42 changer transitions 0/376 dead transitions. [2025-02-08 05:40:03,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 376 transitions, 1215 flow [2025-02-08 05:40:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:40:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:40:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3702 transitions. [2025-02-08 05:40:03,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8835322195704057 [2025-02-08 05:40:03,589 INFO L175 Difference]: Start difference. First operand has 360 places, 356 transitions, 985 flow. Second operand 10 states and 3702 transitions. [2025-02-08 05:40:03,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 376 transitions, 1215 flow [2025-02-08 05:40:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 376 transitions, 1142 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:40:03,596 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 1017 flow [2025-02-08 05:40:03,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1017, PETRI_PLACES=364, PETRI_TRANSITIONS=358} [2025-02-08 05:40:03,597 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, 0 predicate places. [2025-02-08 05:40:03,597 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 1017 flow [2025-02-08 05:40:03,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 366.42857142857144) internal successors, (2565), 7 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:03,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:03,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:03,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:03,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 484747878, now seen corresponding path program 1 times [2025-02-08 05:40:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378274442] [2025-02-08 05:40:03,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:03,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 05:40:03,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 05:40:03,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:03,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378274442] [2025-02-08 05:40:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378274442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:03,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:03,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012876096] [2025-02-08 05:40:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:03,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:03,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:03,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:03,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 419 [2025-02-08 05:40:03,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 358 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 393.6666666666667) internal successors, (1181), 3 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:03,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 419 [2025-02-08 05:40:03,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:03,734 INFO L124 PetriNetUnfolderBase]: 12/655 cut-off events. [2025-02-08 05:40:03,735 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-08 05:40:03,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 655 events. 12/655 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1576 event pairs, 0 based on Foata normal form. 2/637 useless extension candidates. Maximal degree in co-relation 805. Up to 19 conditions per place. [2025-02-08 05:40:03,737 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 5 selfloop transitions, 0 changer transitions 28/357 dead transitions. [2025-02-08 05:40:03,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 357 transitions, 1029 flow [2025-02-08 05:40:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1181 transitions. [2025-02-08 05:40:03,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939538583929992 [2025-02-08 05:40:03,740 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 1017 flow. Second operand 3 states and 1181 transitions. [2025-02-08 05:40:03,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 357 transitions, 1029 flow [2025-02-08 05:40:03,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 956 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:40:03,746 INFO L231 Difference]: Finished difference. Result has 358 places, 329 transitions, 783 flow [2025-02-08 05:40:03,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=358, PETRI_TRANSITIONS=329} [2025-02-08 05:40:03,747 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -6 predicate places. [2025-02-08 05:40:03,747 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 329 transitions, 783 flow [2025-02-08 05:40:03,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.6666666666667) internal successors, (1181), 3 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:03,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:03,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:03,748 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -777024052, now seen corresponding path program 1 times [2025-02-08 05:40:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174731484] [2025-02-08 05:40:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:03,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:40:03,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:40:03,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:40:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174731484] [2025-02-08 05:40:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174731484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811647413] [2025-02-08 05:40:04,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:04,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:04,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 419 [2025-02-08 05:40:04,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 329 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:04,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 419 [2025-02-08 05:40:04,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:04,509 INFO L124 PetriNetUnfolderBase]: 20/552 cut-off events. [2025-02-08 05:40:04,509 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:40:04,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 552 events. 20/552 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1521 event pairs, 4 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 715. Up to 42 conditions per place. [2025-02-08 05:40:04,511 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 30 selfloop transitions, 4 changer transitions 0/336 dead transitions. [2025-02-08 05:40:04,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 336 transitions, 873 flow [2025-02-08 05:40:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2267 transitions. [2025-02-08 05:40:04,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017501988862371 [2025-02-08 05:40:04,515 INFO L175 Difference]: Start difference. First operand has 358 places, 329 transitions, 783 flow. Second operand 6 states and 2267 transitions. [2025-02-08 05:40:04,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 336 transitions, 873 flow [2025-02-08 05:40:04,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 336 transitions, 801 flow, removed 14 selfloop flow, removed 13 redundant places. [2025-02-08 05:40:04,519 INFO L231 Difference]: Finished difference. Result has 340 places, 328 transitions, 717 flow [2025-02-08 05:40:04,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=717, PETRI_PLACES=340, PETRI_TRANSITIONS=328} [2025-02-08 05:40:04,521 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -24 predicate places. [2025-02-08 05:40:04,521 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 328 transitions, 717 flow [2025-02-08 05:40:04,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:04,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:04,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:04,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:04,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1969701836, now seen corresponding path program 1 times [2025-02-08 05:40:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041453156] [2025-02-08 05:40:04,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:04,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:40:04,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:40:04,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:04,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:40:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041453156] [2025-02-08 05:40:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041453156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135011878] [2025-02-08 05:40:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:04,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:05,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 419 [2025-02-08 05:40:05,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 328 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 375.6666666666667) internal successors, (2254), 6 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:05,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 419 [2025-02-08 05:40:05,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,155 INFO L124 PetriNetUnfolderBase]: 21/581 cut-off events. [2025-02-08 05:40:05,156 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:40:05,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 581 events. 21/581 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1730 event pairs, 4 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 701. Up to 42 conditions per place. [2025-02-08 05:40:05,159 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 30 selfloop transitions, 4 changer transitions 0/335 dead transitions. [2025-02-08 05:40:05,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 335 transitions, 807 flow [2025-02-08 05:40:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2267 transitions. [2025-02-08 05:40:05,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017501988862371 [2025-02-08 05:40:05,162 INFO L175 Difference]: Start difference. First operand has 340 places, 328 transitions, 717 flow. Second operand 6 states and 2267 transitions. [2025-02-08 05:40:05,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 335 transitions, 807 flow [2025-02-08 05:40:05,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 335 transitions, 800 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:05,166 INFO L231 Difference]: Finished difference. Result has 340 places, 327 transitions, 716 flow [2025-02-08 05:40:05,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=716, PETRI_PLACES=340, PETRI_TRANSITIONS=327} [2025-02-08 05:40:05,167 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -24 predicate places. [2025-02-08 05:40:05,167 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 327 transitions, 716 flow [2025-02-08 05:40:05,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.6666666666667) internal successors, (2254), 6 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:05,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:05,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:05,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:05,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1241160536, now seen corresponding path program 1 times [2025-02-08 05:40:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570951254] [2025-02-08 05:40:05,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:05,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:05,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:40:05,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:40:05,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:05,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:40:05,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:05,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570951254] [2025-02-08 05:40:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570951254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:05,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537419282] [2025-02-08 05:40:05,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:05,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:05,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:05,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:05,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 419 [2025-02-08 05:40:05,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 327 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 375.8333333333333) internal successors, (2255), 6 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:05,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 419 [2025-02-08 05:40:05,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,832 INFO L124 PetriNetUnfolderBase]: 21/586 cut-off events. [2025-02-08 05:40:05,832 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:40:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 586 events. 21/586 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1757 event pairs, 4 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 706. Up to 42 conditions per place. [2025-02-08 05:40:05,835 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 29 selfloop transitions, 4 changer transitions 3/334 dead transitions. [2025-02-08 05:40:05,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 334 transitions, 806 flow [2025-02-08 05:40:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2267 transitions. [2025-02-08 05:40:05,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017501988862371 [2025-02-08 05:40:05,838 INFO L175 Difference]: Start difference. First operand has 340 places, 327 transitions, 716 flow. Second operand 6 states and 2267 transitions. [2025-02-08 05:40:05,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 334 transitions, 806 flow [2025-02-08 05:40:05,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 334 transitions, 799 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:05,842 INFO L231 Difference]: Finished difference. Result has 340 places, 323 transitions, 709 flow [2025-02-08 05:40:05,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=340, PETRI_TRANSITIONS=323} [2025-02-08 05:40:05,843 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -24 predicate places. [2025-02-08 05:40:05,843 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 323 transitions, 709 flow [2025-02-08 05:40:05,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.8333333333333) internal successors, (2255), 6 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:05,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:05,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:40:05,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:40:05,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash -990486340, now seen corresponding path program 1 times [2025-02-08 05:40:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685972840] [2025-02-08 05:40:05,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:05,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 05:40:05,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 05:40:05,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:05,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:40:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685972840] [2025-02-08 05:40:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685972840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406395030] [2025-02-08 05:40:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:06,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:06,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:06,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 419 [2025-02-08 05:40:06,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 323 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 375.8333333333333) internal successors, (2255), 6 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 419 [2025-02-08 05:40:06,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:06,561 INFO L124 PetriNetUnfolderBase]: 24/567 cut-off events. [2025-02-08 05:40:06,561 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:06,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 567 events. 24/567 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1665 event pairs, 2 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 709. Up to 37 conditions per place. [2025-02-08 05:40:06,565 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 0 selfloop transitions, 0 changer transitions 330/330 dead transitions. [2025-02-08 05:40:06,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 330 transitions, 797 flow [2025-02-08 05:40:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2266 transitions. [2025-02-08 05:40:06,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013524264120922 [2025-02-08 05:40:06,569 INFO L175 Difference]: Start difference. First operand has 340 places, 323 transitions, 709 flow. Second operand 6 states and 2266 transitions. [2025-02-08 05:40:06,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 330 transitions, 797 flow [2025-02-08 05:40:06,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 330 transitions, 790 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:06,572 INFO L231 Difference]: Finished difference. Result has 337 places, 0 transitions, 0 flow [2025-02-08 05:40:06,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=337, PETRI_TRANSITIONS=0} [2025-02-08 05:40:06,573 INFO L279 CegarLoopForPetriNet]: 364 programPoint places, -27 predicate places. [2025-02-08 05:40:06,573 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 0 transitions, 0 flow [2025-02-08 05:40:06,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.8333333333333) internal successors, (2255), 6 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-02-08 05:40:06,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-02-08 05:40:06,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-02-08 05:40:06,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-02-08 05:40:06,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:40:06,582 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:06,589 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:06,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:06,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:06 BasicIcfg [2025-02-08 05:40:06,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:06,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:06,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:06,594 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:06,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:58" (3/4) ... [2025-02-08 05:40:06,595 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:06,597 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:06,597 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:06,597 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:06,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 05:40:06,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 05:40:06,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:06,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:06,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:06,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:06,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:06,664 INFO L158 Benchmark]: Toolchain (without parser) took 9375.92ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 130.8MB in the beginning and 203.4MB in the end (delta: -72.6MB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. [2025-02-08 05:40:06,664 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 218.1MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:06,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.76ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 118.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:06,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.23ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:06,665 INFO L158 Benchmark]: Boogie Preprocessor took 43.63ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 113.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:06,666 INFO L158 Benchmark]: IcfgBuilder took 726.94ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 75.7MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:06,666 INFO L158 Benchmark]: TraceAbstraction took 8241.53ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 74.8MB in the beginning and 211.8MB in the end (delta: -137.0MB). Peak memory consumption was 268.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:06,666 INFO L158 Benchmark]: Witness Printer took 69.44ms. Allocated memory is still 578.8MB. Free memory was 211.8MB in the beginning and 203.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:06,667 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 218.1MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.76ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 118.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.23ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.63ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 113.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 726.94ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 75.7MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8241.53ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 74.8MB in the beginning and 211.8MB in the end (delta: -137.0MB). Peak memory consumption was 268.4MB. Max. memory is 16.1GB. * Witness Printer took 69.44ms. Allocated memory is still 578.8MB. Free memory was 211.8MB in the beginning and 203.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 544 locations, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2339 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1515 mSDsluCounter, 1367 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1168 mSDsCounter, 327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3527 IncrementalHoareTripleChecker+Invalid, 3854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 327 mSolverCounterUnsat, 199 mSDtfsCounter, 3527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1017occurred in iteration=14, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2549 NumberOfCodeBlocks, 2549 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2530 ConstructedInterpolants, 0 QuantifiedInterpolants, 3859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:06,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE