./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:25,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:25,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:25,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:25,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:25,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:25,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:25,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:25,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:25,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:25,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:25,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:25,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:25,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:25,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:25,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:25,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:25,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:25,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:25,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:25,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:25,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:25,086 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-01-09 21:32:25,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:25,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:25,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:25,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:25,340 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:25,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-01-09 21:32:26,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30f65cd81/b985917c5dd24d9d830721ef0eb0e03a/FLAGacfb0ee4e [2025-01-09 21:32:26,824 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:26,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-01-09 21:32:26,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30f65cd81/b985917c5dd24d9d830721ef0eb0e03a/FLAGacfb0ee4e [2025-01-09 21:32:26,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30f65cd81/b985917c5dd24d9d830721ef0eb0e03a [2025-01-09 21:32:26,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:26,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:26,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:26,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:26,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:26,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:26" (1/1) ... [2025-01-09 21:32:26,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:26, skipping insertion in model container [2025-01-09 21:32:26,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:26" (1/1) ... [2025-01-09 21:32:26,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:27,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:27,010 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:27,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:27,047 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:27,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27 WrapperNode [2025-01-09 21:32:27,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:27,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:27,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:27,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:27,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,078 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2025-01-09 21:32:27,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:27,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:27,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:27,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:27,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:27,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:27,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:27,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:27,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (1/1) ... [2025-01-09 21:32:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:27,145 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-01-09 21:32:27,154 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-01-09 21:32:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:27,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:27,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:27,172 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:27,236 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:27,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:27,427 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:27,427 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:27,448 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:27,449 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:32:27,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:27 BoogieIcfgContainer [2025-01-09 21:32:27,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:27,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:27,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:27,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:26" (1/3) ... [2025-01-09 21:32:27,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6a779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:27, skipping insertion in model container [2025-01-09 21:32:27,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:27" (2/3) ... [2025-01-09 21:32:27,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6a779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:27, skipping insertion in model container [2025-01-09 21:32:27,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:27" (3/3) ... [2025-01-09 21:32:27,456 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-01-09 21:32:27,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:27,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 227 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-01-09 21:32:27,468 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:27,553 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:32:27,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 235 transitions, 498 flow [2025-01-09 21:32:27,683 INFO L124 PetriNetUnfolderBase]: 9/231 cut-off events. [2025-01-09 21:32:27,685 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:27,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 231 events. 9/231 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 349 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2025-01-09 21:32:27,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 235 transitions, 498 flow [2025-01-09 21:32:27,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 214 transitions, 449 flow [2025-01-09 21:32:27,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:27,722 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;@57327d24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:27,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-09 21:32:27,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:27,728 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:32:27,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:27,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,729 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] [2025-01-09 21:32:27,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:27,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash -578257067, now seen corresponding path program 1 times [2025-01-09 21:32:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846596826] [2025-01-09 21:32:27,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:32:27,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:32:27,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846596826] [2025-01-09 21:32:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846596826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223458182] [2025-01-09 21:32:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2025-01-09 21:32:27,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:27,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2025-01-09 21:32:27,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:28,543 INFO L124 PetriNetUnfolderBase]: 527/3114 cut-off events. [2025-01-09 21:32:28,544 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2025-01-09 21:32:28,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 3114 events. 527/3114 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 28033 event pairs, 434 based on Foata normal form. 191/2813 useless extension candidates. Maximal degree in co-relation 3687. Up to 677 conditions per place. [2025-01-09 21:32:28,575 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 20 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2025-01-09 21:32:28,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 481 flow [2025-01-09 21:32:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2025-01-09 21:32:28,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035460992907801 [2025-01-09 21:32:28,593 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 449 flow. Second operand 3 states and 637 transitions. [2025-01-09 21:32:28,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 481 flow [2025-01-09 21:32:28,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 468 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 21:32:28,604 INFO L231 Difference]: Finished difference. Result has 213 places, 207 transitions, 426 flow [2025-01-09 21:32:28,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=213, PETRI_TRANSITIONS=207} [2025-01-09 21:32:28,611 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -6 predicate places. [2025-01-09 21:32:28,611 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 207 transitions, 426 flow [2025-01-09 21:32:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:28,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:28,612 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] [2025-01-09 21:32:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:28,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -879382998, now seen corresponding path program 1 times [2025-01-09 21:32:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088008812] [2025-01-09 21:32:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:28,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:32:28,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:32:28,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:28,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088008812] [2025-01-09 21:32:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088008812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:28,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155236911] [2025-01-09 21:32:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:28,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2025-01-09 21:32:28,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 207 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:28,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:28,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2025-01-09 21:32:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,076 INFO L124 PetriNetUnfolderBase]: 561/3050 cut-off events. [2025-01-09 21:32:29,077 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-09 21:32:29,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 3050 events. 561/3050 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 26818 event pairs, 474 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 3864. Up to 733 conditions per place. [2025-01-09 21:32:29,102 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 20 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-01-09 21:32:29,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 468 flow [2025-01-09 21:32:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2025-01-09 21:32:29,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2025-01-09 21:32:29,105 INFO L175 Difference]: Start difference. First operand has 213 places, 207 transitions, 426 flow. Second operand 3 states and 632 transitions. [2025-01-09 21:32:29,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 468 flow [2025-01-09 21:32:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,111 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 424 flow [2025-01-09 21:32:29,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2025-01-09 21:32:29,112 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -8 predicate places. [2025-01-09 21:32:29,113 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 424 flow [2025-01-09 21:32:29,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:29,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:29,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1772624164, now seen corresponding path program 1 times [2025-01-09 21:32:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673104766] [2025-01-09 21:32:29,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:32:29,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:32:29,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673104766] [2025-01-09 21:32:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673104766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:29,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:29,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473250238] [2025-01-09 21:32:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:29,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:29,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:29,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:29,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2025-01-09 21:32:29,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:29,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:29,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2025-01-09 21:32:29,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,544 INFO L124 PetriNetUnfolderBase]: 543/2599 cut-off events. [2025-01-09 21:32:29,545 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-09 21:32:29,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 2599 events. 543/2599 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 21671 event pairs, 474 based on Foata normal form. 0/2181 useless extension candidates. Maximal degree in co-relation 3399. Up to 733 conditions per place. [2025-01-09 21:32:29,586 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 20 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2025-01-09 21:32:29,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 205 transitions, 466 flow [2025-01-09 21:32:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2025-01-09 21:32:29,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2025-01-09 21:32:29,588 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 424 flow. Second operand 3 states and 632 transitions. [2025-01-09 21:32:29,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 205 transitions, 466 flow [2025-01-09 21:32:29,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 205 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,590 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 422 flow [2025-01-09 21:32:29,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2025-01-09 21:32:29,591 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -9 predicate places. [2025-01-09 21:32:29,591 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 422 flow [2025-01-09 21:32:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:29,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,592 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] [2025-01-09 21:32:29,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:29,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:29,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1586379333, now seen corresponding path program 1 times [2025-01-09 21:32:29,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-01-09 21:32:29,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:32:29,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:32:29,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-01-09 21:32:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124100459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:29,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412855371] [2025-01-09 21:32:29,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:29,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:29,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2025-01-09 21:32:29,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:29,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:29,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2025-01-09 21:32:29,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,923 INFO L124 PetriNetUnfolderBase]: 531/3264 cut-off events. [2025-01-09 21:32:29,923 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-09 21:32:29,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 3264 events. 531/3264 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 29258 event pairs, 434 based on Foata normal form. 0/2760 useless extension candidates. Maximal degree in co-relation 3964. Up to 677 conditions per place. [2025-01-09 21:32:29,949 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 20 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2025-01-09 21:32:29,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 464 flow [2025-01-09 21:32:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2025-01-09 21:32:29,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2025-01-09 21:32:29,953 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 422 flow. Second operand 3 states and 632 transitions. [2025-01-09 21:32:29,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 464 flow [2025-01-09 21:32:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 204 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,956 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 420 flow [2025-01-09 21:32:29,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2025-01-09 21:32:29,958 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -10 predicate places. [2025-01-09 21:32:29,958 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 420 flow [2025-01-09 21:32:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-01-09 21:32:29,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:29,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:29,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2145211804, now seen corresponding path program 1 times [2025-01-09 21:32:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062207534] [2025-01-09 21:32:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:32:29,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:32:29,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062207534] [2025-01-09 21:32:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062207534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237998813] [2025-01-09 21:32:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:30,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:30,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:30,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:30,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2025-01-09 21:32:30,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-01-09 21:32:30,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:30,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2025-01-09 21:32:30,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:30,347 INFO L124 PetriNetUnfolderBase]: 767/3562 cut-off events. [2025-01-09 21:32:30,347 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 21:32:30,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 3562 events. 767/3562 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32948 event pairs, 515 based on Foata normal form. 0/3030 useless extension candidates. Maximal degree in co-relation 4723. Up to 796 conditions per place. [2025-01-09 21:32:30,372 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-01-09 21:32:30,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 212 transitions, 500 flow [2025-01-09 21:32:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-01-09 21:32:30,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2025-01-09 21:32:30,378 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 420 flow. Second operand 3 states and 646 transitions. [2025-01-09 21:32:30,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 212 transitions, 500 flow [2025-01-09 21:32:30,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 212 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:30,380 INFO L231 Difference]: Finished difference. Result has 208 places, 203 transitions, 418 flow [2025-01-09 21:32:30,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=208, PETRI_TRANSITIONS=203} [2025-01-09 21:32:30,381 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -11 predicate places. [2025-01-09 21:32:30,381 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 203 transitions, 418 flow [2025-01-09 21:32:30,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-01-09 21:32:30,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:30,382 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] [2025-01-09 21:32:30,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:30,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 12936735, now seen corresponding path program 1 times [2025-01-09 21:32:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804952726] [2025-01-09 21:32:30,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:30,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:32:30,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:32:30,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:30,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:30,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:30,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804952726] [2025-01-09 21:32:30,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804952726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:30,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752740652] [2025-01-09 21:32:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:30,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:30,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:30,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:30,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2025-01-09 21:32:30,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 203 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-01-09 21:32:30,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:30,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2025-01-09 21:32:30,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:30,668 INFO L124 PetriNetUnfolderBase]: 563/2526 cut-off events. [2025-01-09 21:32:30,668 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-09 21:32:30,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 2526 events. 563/2526 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 21785 event pairs, 204 based on Foata normal form. 0/2198 useless extension candidates. Maximal degree in co-relation 2358. Up to 470 conditions per place. [2025-01-09 21:32:30,682 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 27 selfloop transitions, 1 changer transitions 0/211 dead transitions. [2025-01-09 21:32:30,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 211 transitions, 494 flow [2025-01-09 21:32:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-01-09 21:32:30,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2025-01-09 21:32:30,684 INFO L175 Difference]: Start difference. First operand has 208 places, 203 transitions, 418 flow. Second operand 3 states and 650 transitions. [2025-01-09 21:32:30,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 211 transitions, 494 flow [2025-01-09 21:32:30,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 211 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:30,687 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 414 flow [2025-01-09 21:32:30,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2025-01-09 21:32:30,688 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2025-01-09 21:32:30,688 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 414 flow [2025-01-09 21:32:30,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-01-09 21:32:30,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:30,689 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] [2025-01-09 21:32:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:30,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1900918386, now seen corresponding path program 1 times [2025-01-09 21:32:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533347873] [2025-01-09 21:32:30,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:30,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:32:30,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:32:30,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:30,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533347873] [2025-01-09 21:32:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533347873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:30,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915212279] [2025-01-09 21:32:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:30,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:30,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:30,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:30,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2025-01-09 21:32:30,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-01-09 21:32:30,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:30,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2025-01-09 21:32:30,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:31,037 INFO L124 PetriNetUnfolderBase]: 875/3414 cut-off events. [2025-01-09 21:32:31,037 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-09 21:32:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 3414 events. 875/3414 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 30018 event pairs, 575 based on Foata normal form. 0/2910 useless extension candidates. Maximal degree in co-relation 3540. Up to 880 conditions per place. [2025-01-09 21:32:31,061 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-01-09 21:32:31,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 210 transitions, 494 flow [2025-01-09 21:32:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-01-09 21:32:31,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2025-01-09 21:32:31,063 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 414 flow. Second operand 3 states and 646 transitions. [2025-01-09 21:32:31,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 210 transitions, 494 flow [2025-01-09 21:32:31,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 210 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:31,066 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 415 flow [2025-01-09 21:32:31,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2025-01-09 21:32:31,067 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2025-01-09 21:32:31,067 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 415 flow [2025-01-09 21:32:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-01-09 21:32:31,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:32:31,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:31,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:31,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -213432431, now seen corresponding path program 1 times [2025-01-09 21:32:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080383986] [2025-01-09 21:32:31,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:32:31,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:32:31,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080383986] [2025-01-09 21:32:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080383986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018637762] [2025-01-09 21:32:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2025-01-09 21:32:31,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-01-09 21:32:31,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2025-01-09 21:32:31,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:31,393 INFO L124 PetriNetUnfolderBase]: 652/2799 cut-off events. [2025-01-09 21:32:31,393 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:32:31,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2799 events. 652/2799 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 23752 event pairs, 323 based on Foata normal form. 0/2454 useless extension candidates. Maximal degree in co-relation 2821. Up to 473 conditions per place. [2025-01-09 21:32:31,414 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 27 selfloop transitions, 1 changer transitions 0/209 dead transitions. [2025-01-09 21:32:31,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 209 transitions, 491 flow [2025-01-09 21:32:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-01-09 21:32:31,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2025-01-09 21:32:31,416 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 415 flow. Second operand 3 states and 650 transitions. [2025-01-09 21:32:31,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 209 transitions, 491 flow [2025-01-09 21:32:31,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:31,420 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 411 flow [2025-01-09 21:32:31,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2025-01-09 21:32:31,421 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-01-09 21:32:31,421 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 411 flow [2025-01-09 21:32:31,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-01-09 21:32:31,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:31,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:31,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2115897202, now seen corresponding path program 1 times [2025-01-09 21:32:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159568099] [2025-01-09 21:32:31,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:32:31,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:32:31,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159568099] [2025-01-09 21:32:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159568099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223084743] [2025-01-09 21:32:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2025-01-09 21:32:31,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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-01-09 21:32:31,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2025-01-09 21:32:31,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:31,741 INFO L124 PetriNetUnfolderBase]: 848/2824 cut-off events. [2025-01-09 21:32:31,741 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-09 21:32:31,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 2824 events. 848/2824 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22243 event pairs, 548 based on Foata normal form. 0/2475 useless extension candidates. Maximal degree in co-relation 2912. Up to 880 conditions per place. [2025-01-09 21:32:31,762 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-01-09 21:32:31,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 208 transitions, 491 flow [2025-01-09 21:32:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-01-09 21:32:31,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2025-01-09 21:32:31,765 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 411 flow. Second operand 3 states and 646 transitions. [2025-01-09 21:32:31,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 208 transitions, 491 flow [2025-01-09 21:32:31,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:31,768 INFO L231 Difference]: Finished difference. Result has 206 places, 199 transitions, 412 flow [2025-01-09 21:32:31,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=206, PETRI_TRANSITIONS=199} [2025-01-09 21:32:31,768 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-01-09 21:32:31,768 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 199 transitions, 412 flow [2025-01-09 21:32:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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-01-09 21:32:31,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,769 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] [2025-01-09 21:32:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:31,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1457118667, now seen corresponding path program 1 times [2025-01-09 21:32:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-01-09 21:32:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:32:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:32:31,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-01-09 21:32:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232696962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989483033] [2025-01-09 21:32:31,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2025-01-09 21:32:31,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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-01-09 21:32:31,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2025-01-09 21:32:31,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,058 INFO L124 PetriNetUnfolderBase]: 637/2464 cut-off events. [2025-01-09 21:32:32,058 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-01-09 21:32:32,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3587 conditions, 2464 events. 637/2464 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 19432 event pairs, 297 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 2475. Up to 452 conditions per place. [2025-01-09 21:32:32,076 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 27 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2025-01-09 21:32:32,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 488 flow [2025-01-09 21:32:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-01-09 21:32:32,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2025-01-09 21:32:32,078 INFO L175 Difference]: Start difference. First operand has 206 places, 199 transitions, 412 flow. Second operand 3 states and 650 transitions. [2025-01-09 21:32:32,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 488 flow [2025-01-09 21:32:32,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:32,082 INFO L231 Difference]: Finished difference. Result has 205 places, 198 transitions, 408 flow [2025-01-09 21:32:32,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=205, PETRI_TRANSITIONS=198} [2025-01-09 21:32:32,082 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places. [2025-01-09 21:32:32,082 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 198 transitions, 408 flow [2025-01-09 21:32:32,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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-01-09 21:32:32,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:32,083 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] [2025-01-09 21:32:32,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:32,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:32,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2117028161, now seen corresponding path program 1 times [2025-01-09 21:32:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:32,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636556224] [2025-01-09 21:32:32,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:32,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:32,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:32:32,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:32:32,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:32,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636556224] [2025-01-09 21:32:32,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636556224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:32,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:32,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:32,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579255191] [2025-01-09 21:32:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:32,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:32,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:32,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:32,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2025-01-09 21:32:32,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 198 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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-01-09 21:32:32,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:32,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2025-01-09 21:32:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,378 INFO L124 PetriNetUnfolderBase]: 779/3277 cut-off events. [2025-01-09 21:32:32,378 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-09 21:32:32,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 3277 events. 779/3277 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 27715 event pairs, 515 based on Foata normal form. 0/2870 useless extension candidates. Maximal degree in co-relation 3688. Up to 796 conditions per place. [2025-01-09 21:32:32,393 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-01-09 21:32:32,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 487 flow [2025-01-09 21:32:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-01-09 21:32:32,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2025-01-09 21:32:32,395 INFO L175 Difference]: Start difference. First operand has 205 places, 198 transitions, 408 flow. Second operand 3 states and 646 transitions. [2025-01-09 21:32:32,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 487 flow [2025-01-09 21:32:32,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:32,397 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 409 flow [2025-01-09 21:32:32,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2025-01-09 21:32:32,398 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places. [2025-01-09 21:32:32,398 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 409 flow [2025-01-09 21:32:32,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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-01-09 21:32:32,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:32,399 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] [2025-01-09 21:32:32,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:32,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:32:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 707989954, now seen corresponding path program 1 times [2025-01-09 21:32:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958849674] [2025-01-09 21:32:32,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:32,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:32:32,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:32:32,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:32,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958849674] [2025-01-09 21:32:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958849674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712239404] [2025-01-09 21:32:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:32,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:32,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:32,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2025-01-09 21:32:32,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-01-09 21:32:32,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:32,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2025-01-09 21:32:32,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,638 INFO L124 PetriNetUnfolderBase]: 617/2919 cut-off events. [2025-01-09 21:32:32,638 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-09 21:32:32,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 2919 events. 617/2919 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 24348 event pairs, 272 based on Foata normal form. 0/2600 useless extension candidates. Maximal degree in co-relation 3129. Up to 433 conditions per place. [2025-01-09 21:32:32,650 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 0 selfloop transitions, 0 changer transitions 205/205 dead transitions. [2025-01-09 21:32:32,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 205 transitions, 484 flow [2025-01-09 21:32:32,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-01-09 21:32:32,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2025-01-09 21:32:32,652 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 409 flow. Second operand 3 states and 650 transitions. [2025-01-09 21:32:32,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 205 transitions, 484 flow [2025-01-09 21:32:32,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 205 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:32,654 INFO L231 Difference]: Finished difference. Result has 204 places, 0 transitions, 0 flow [2025-01-09 21:32:32,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=204, PETRI_TRANSITIONS=0} [2025-01-09 21:32:32,655 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -15 predicate places. [2025-01-09 21:32:32,655 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 0 transitions, 0 flow [2025-01-09 21:32:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-01-09 21:32:32,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 24 remaining) [2025-01-09 21:32:32,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2025-01-09 21:32:32,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-01-09 21:32:32,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-01-09 21:32:32,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-01-09 21:32:32,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-01-09 21:32:32,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-01-09 21:32:32,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-01-09 21:32:32,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-01-09 21:32:32,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-01-09 21:32:32,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:32,659 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:32,663 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:32,663 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:32,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:32 BasicIcfg [2025-01-09 21:32:32,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:32,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:32,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:32,667 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:32,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:27" (3/4) ... [2025-01-09 21:32:32,669 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:32,671 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:32,671 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:32,671 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:32,671 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:32,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:32:32,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:32,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:32:32,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:32,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:32,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:32,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:32,729 INFO L158 Benchmark]: Toolchain (without parser) took 5880.23ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 109.1MB in the beginning and 575.1MB in the end (delta: -466.0MB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:32,730 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:32,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.79ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 97.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:32,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.15ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:32,730 INFO L158 Benchmark]: Boogie Preprocessor took 26.58ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 984.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:32,730 INFO L158 Benchmark]: RCFGBuilder took 343.10ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 74.3MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:32,731 INFO L158 Benchmark]: TraceAbstraction took 5216.20ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 74.3MB in the beginning and 579.6MB in the end (delta: -505.3MB). Peak memory consumption was 197.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:32,731 INFO L158 Benchmark]: Witness Printer took 61.70ms. Allocated memory is still 847.2MB. Free memory was 579.6MB in the beginning and 575.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:32,732 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.79ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 97.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.15ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.58ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 984.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 343.10ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 74.3MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5216.20ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 74.3MB in the beginning and 579.6MB in the end (delta: -505.3MB). Peak memory consumption was 197.1MB. Max. memory is 16.1GB. * Witness Printer took 61.70ms. Allocated memory is still 847.2MB. Free memory was 579.6MB in the beginning and 575.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 335 locations, 24 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: 5.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 605 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 30 mSDtfsCounter, 605 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 912 NumberOfCodeBlocks, 912 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:32,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE