./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.i --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/goblint-regression/04-mutex_04-munge_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09d5acb2f81ee0994352651dad5f891cf0af6948836360f3240d2ea1a246e8a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:21:48,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:21:48,295 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:21:48,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:21:48,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:21:48,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:21:48,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:21:48,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:21:48,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:21:48,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:21:48,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:21:48,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:21:48,345 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:21:48,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:21:48,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:21:48,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:21:48,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:21:48,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:21:48,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:48,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:48,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:21:48,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:21:48,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:21:48,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:21:48,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:21:48,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:21:48,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:21:48,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:21:48,351 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 -> 09d5acb2f81ee0994352651dad5f891cf0af6948836360f3240d2ea1a246e8a6 [2025-01-09 21:21:48,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:21:48,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:21:48,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:21:48,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:21:48,636 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:21:48,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.i [2025-01-09 21:21:49,802 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be71d8c85/97abf15ae6174ee6a1890ec660487f18/FLAG950502eae [2025-01-09 21:21:50,097 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:21:50,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.i [2025-01-09 21:21:50,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be71d8c85/97abf15ae6174ee6a1890ec660487f18/FLAG950502eae [2025-01-09 21:21:50,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be71d8c85/97abf15ae6174ee6a1890ec660487f18 [2025-01-09 21:21:50,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:21:50,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:21:50,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:21:50,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:21:50,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:21:50,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d2865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50, skipping insertion in model container [2025-01-09 21:21:50,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:21:50,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:21:50,758 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:21:50,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:21:50,841 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:21:50,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50 WrapperNode [2025-01-09 21:21:50,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:21:50,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:21:50,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:21:50,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:21:50,848 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:21:50" (1/1) ... [2025-01-09 21:21:50,856 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:21:50" (1/1) ... [2025-01-09 21:21:50,872 INFO L138 Inliner]: procedures = 263, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-01-09 21:21:50,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:21:50,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:21:50,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:21:50,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:21:50,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:21:50,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:21:50,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:21:50,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:21:50,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (1/1) ... [2025-01-09 21:21:50,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:21:50,931 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:21:50,936 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:21:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:21:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:21:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:21:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:21:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:21:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:21:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:21:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:21:50,953 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:21:51,038 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:21:51,040 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:21:51,126 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:21:51,128 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:21:51,147 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:21:51,148 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:21:51,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:51 BoogieIcfgContainer [2025-01-09 21:21:51,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:21:51,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:21:51,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:21:51,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:21:51,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:21:50" (1/3) ... [2025-01-09 21:21:51,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c35a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:21:51, skipping insertion in model container [2025-01-09 21:21:51,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:50" (2/3) ... [2025-01-09 21:21:51,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c35a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:21:51, skipping insertion in model container [2025-01-09 21:21:51,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:51" (3/3) ... [2025-01-09 21:21:51,161 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_04-munge_nr.i [2025-01-09 21:21:51,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:21:51,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_04-munge_nr.i that has 2 procedures, 65 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-09 21:21:51,182 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:21:51,218 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:21:51,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 64 transitions, 135 flow [2025-01-09 21:21:51,264 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2025-01-09 21:21:51,265 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:21:51,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 63 events. 0/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-09 21:21:51,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 64 transitions, 135 flow [2025-01-09 21:21:51,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 119 flow [2025-01-09 21:21:51,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:21:51,287 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;@6debdc23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:21:51,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:21:51,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:21:51,295 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:21:51,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:51,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:51,296 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] [2025-01-09 21:21:51,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 511625068, now seen corresponding path program 1 times [2025-01-09 21:21:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984630685] [2025-01-09 21:21:51,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:51,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:21:51,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:21:51,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:51,508 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:21:51,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984630685] [2025-01-09 21:21:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984630685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:51,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530302538] [2025-01-09 21:21:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:51,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:51,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:51,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 64 [2025-01-09 21:21:51,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:21:51,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:51,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 64 [2025-01-09 21:21:51,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:51,640 INFO L124 PetriNetUnfolderBase]: 31/195 cut-off events. [2025-01-09 21:21:51,640 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:21:51,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 195 events. 31/195 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 807 event pairs, 13 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 256. Up to 44 conditions per place. [2025-01-09 21:21:51,643 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 17 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2025-01-09 21:21:51,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 185 flow [2025-01-09 21:21:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-01-09 21:21:51,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2025-01-09 21:21:51,653 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 119 flow. Second operand 3 states and 175 transitions. [2025-01-09 21:21:51,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 185 flow [2025-01-09 21:21:51,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 68 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:51,659 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 170 flow [2025-01-09 21:21:51,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2025-01-09 21:21:51,663 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-01-09 21:21:51,663 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 170 flow [2025-01-09 21:21:51,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:21:51,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:51,663 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] [2025-01-09 21:21:51,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:21:51,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1442047057, now seen corresponding path program 1 times [2025-01-09 21:21:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:51,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296449555] [2025-01-09 21:21:51,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:51,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:21:51,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:21:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:51,733 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:21:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296449555] [2025-01-09 21:21:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296449555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:51,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:51,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:51,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377742691] [2025-01-09 21:21:51,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:51,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:51,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 64 [2025-01-09 21:21:51,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:21:51,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:51,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 64 [2025-01-09 21:21:51,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:51,804 INFO L124 PetriNetUnfolderBase]: 56/263 cut-off events. [2025-01-09 21:21:51,805 INFO L125 PetriNetUnfolderBase]: For 107/115 co-relation queries the response was YES. [2025-01-09 21:21:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 263 events. 56/263 cut-off events. For 107/115 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1284 event pairs, 30 based on Foata normal form. 4/250 useless extension candidates. Maximal degree in co-relation 476. Up to 108 conditions per place. [2025-01-09 21:21:51,806 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 18 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2025-01-09 21:21:51,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 246 flow [2025-01-09 21:21:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-01-09 21:21:51,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2025-01-09 21:21:51,808 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 170 flow. Second operand 3 states and 166 transitions. [2025-01-09 21:21:51,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 246 flow [2025-01-09 21:21:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:51,810 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 214 flow [2025-01-09 21:21:51,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2025-01-09 21:21:51,810 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-09 21:21:51,810 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 214 flow [2025-01-09 21:21:51,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:21:51,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:51,811 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] [2025-01-09 21:21:51,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:21:51,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -118161824, now seen corresponding path program 1 times [2025-01-09 21:21:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454050614] [2025-01-09 21:21:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:51,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:21:51,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:21:51,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:51,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:51,854 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:21:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454050614] [2025-01-09 21:21:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454050614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:51,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:51,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008453713] [2025-01-09 21:21:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:51,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:51,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:51,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:51,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 64 [2025-01-09 21:21:51,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:21:51,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:51,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 64 [2025-01-09 21:21:51,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:51,915 INFO L124 PetriNetUnfolderBase]: 69/295 cut-off events. [2025-01-09 21:21:51,915 INFO L125 PetriNetUnfolderBase]: For 207/215 co-relation queries the response was YES. [2025-01-09 21:21:51,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 295 events. 69/295 cut-off events. For 207/215 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1435 event pairs, 30 based on Foata normal form. 2/281 useless extension candidates. Maximal degree in co-relation 617. Up to 125 conditions per place. [2025-01-09 21:21:51,916 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 17 selfloop transitions, 7 changer transitions 7/76 dead transitions. [2025-01-09 21:21:51,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 300 flow [2025-01-09 21:21:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-01-09 21:21:51,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2025-01-09 21:21:51,918 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 214 flow. Second operand 3 states and 166 transitions. [2025-01-09 21:21:51,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 300 flow [2025-01-09 21:21:51,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:51,920 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 232 flow [2025-01-09 21:21:51,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2025-01-09 21:21:51,921 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-09 21:21:51,921 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 232 flow [2025-01-09 21:21:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:21:51,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:51,921 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] [2025-01-09 21:21:51,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:21:51,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash -175451875, now seen corresponding path program 1 times [2025-01-09 21:21:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428898680] [2025-01-09 21:21:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:51,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:51,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:52,149 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:21:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428898680] [2025-01-09 21:21:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428898680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870448499] [2025-01-09 21:21:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:52,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:52,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:52,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:52,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:52,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:52,433 INFO L124 PetriNetUnfolderBase]: 72/423 cut-off events. [2025-01-09 21:21:52,433 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-01-09 21:21:52,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 423 events. 72/423 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2425 event pairs, 16 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 838. Up to 54 conditions per place. [2025-01-09 21:21:52,435 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 17 selfloop transitions, 14 changer transitions 21/104 dead transitions. [2025-01-09 21:21:52,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 408 flow [2025-01-09 21:21:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:21:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:21:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 570 transitions. [2025-01-09 21:21:52,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8096590909090909 [2025-01-09 21:21:52,437 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 232 flow. Second operand 11 states and 570 transitions. [2025-01-09 21:21:52,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 408 flow [2025-01-09 21:21:52,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:52,444 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 264 flow [2025-01-09 21:21:52,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=264, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-01-09 21:21:52,444 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-01-09 21:21:52,444 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 264 flow [2025-01-09 21:21:52,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:52,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:52,445 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] [2025-01-09 21:21:52,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:21:52,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:52,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash -157100995, now seen corresponding path program 2 times [2025-01-09 21:21:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:52,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812312347] [2025-01-09 21:21:52,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:21:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:52,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:52,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:52,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:21:52,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:52,572 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:21:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:52,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812312347] [2025-01-09 21:21:52,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812312347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:52,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689045001] [2025-01-09 21:21:52,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:52,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:52,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:52,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:52,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:52,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:52,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:52,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:52,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:52,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:52,807 INFO L124 PetriNetUnfolderBase]: 67/495 cut-off events. [2025-01-09 21:21:52,807 INFO L125 PetriNetUnfolderBase]: For 244/252 co-relation queries the response was YES. [2025-01-09 21:21:52,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 495 events. 67/495 cut-off events. For 244/252 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3206 event pairs, 9 based on Foata normal form. 9/490 useless extension candidates. Maximal degree in co-relation 1072. Up to 76 conditions per place. [2025-01-09 21:21:52,809 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 23 selfloop transitions, 18 changer transitions 7/100 dead transitions. [2025-01-09 21:21:52,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 100 transitions, 452 flow [2025-01-09 21:21:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:21:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:21:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 516 transitions. [2025-01-09 21:21:52,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.80625 [2025-01-09 21:21:52,811 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 264 flow. Second operand 10 states and 516 transitions. [2025-01-09 21:21:52,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 100 transitions, 452 flow [2025-01-09 21:21:52,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 100 transitions, 446 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:52,815 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 369 flow [2025-01-09 21:21:52,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-01-09 21:21:52,816 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 29 predicate places. [2025-01-09 21:21:52,816 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 369 flow [2025-01-09 21:21:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:52,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:52,816 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] [2025-01-09 21:21:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:21:52,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1907650449, now seen corresponding path program 3 times [2025-01-09 21:21:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223602088] [2025-01-09 21:21:52,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:21:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:52,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:52,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:52,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:21:52,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:53,008 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:21:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223602088] [2025-01-09 21:21:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223602088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650648922] [2025-01-09 21:21:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:53,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:53,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:53,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:53,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:53,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:53,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:53,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:53,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:53,308 INFO L124 PetriNetUnfolderBase]: 94/642 cut-off events. [2025-01-09 21:21:53,308 INFO L125 PetriNetUnfolderBase]: For 620/636 co-relation queries the response was YES. [2025-01-09 21:21:53,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 642 events. 94/642 cut-off events. For 620/636 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4707 event pairs, 16 based on Foata normal form. 9/631 useless extension candidates. Maximal degree in co-relation 1598. Up to 102 conditions per place. [2025-01-09 21:21:53,311 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 22 selfloop transitions, 26 changer transitions 3/103 dead transitions. [2025-01-09 21:21:53,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 577 flow [2025-01-09 21:21:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:21:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:21:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 559 transitions. [2025-01-09 21:21:53,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7940340909090909 [2025-01-09 21:21:53,315 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 369 flow. Second operand 11 states and 559 transitions. [2025-01-09 21:21:53,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 577 flow [2025-01-09 21:21:53,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 103 transitions, 553 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-09 21:21:53,319 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 494 flow [2025-01-09 21:21:53,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=494, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-01-09 21:21:53,321 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2025-01-09 21:21:53,322 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 494 flow [2025-01-09 21:21:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:53,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:53,322 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] [2025-01-09 21:21:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:21:53,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1213033765, now seen corresponding path program 4 times [2025-01-09 21:21:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923838181] [2025-01-09 21:21:53,323 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:21:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:53,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 21:21:53,335 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-01-09 21:21:53,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:21:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:53,433 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:21:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923838181] [2025-01-09 21:21:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923838181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:53,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437457501] [2025-01-09 21:21:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:53,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:53,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:53,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:53,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:53,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 494 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:53,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:53,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:53,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:53,679 INFO L124 PetriNetUnfolderBase]: 93/647 cut-off events. [2025-01-09 21:21:53,680 INFO L125 PetriNetUnfolderBase]: For 1040/1054 co-relation queries the response was YES. [2025-01-09 21:21:53,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 647 events. 93/647 cut-off events. For 1040/1054 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4731 event pairs, 13 based on Foata normal form. 10/639 useless extension candidates. Maximal degree in co-relation 1699. Up to 104 conditions per place. [2025-01-09 21:21:53,682 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 26 selfloop transitions, 26 changer transitions 2/106 dead transitions. [2025-01-09 21:21:53,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 669 flow [2025-01-09 21:21:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:21:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:21:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 568 transitions. [2025-01-09 21:21:53,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8068181818181818 [2025-01-09 21:21:53,684 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 494 flow. Second operand 11 states and 568 transitions. [2025-01-09 21:21:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 669 flow [2025-01-09 21:21:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 651 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:21:53,688 INFO L231 Difference]: Finished difference. Result has 108 places, 96 transitions, 588 flow [2025-01-09 21:21:53,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=588, PETRI_PLACES=108, PETRI_TRANSITIONS=96} [2025-01-09 21:21:53,689 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 46 predicate places. [2025-01-09 21:21:53,689 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 96 transitions, 588 flow [2025-01-09 21:21:53,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:53,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:53,690 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] [2025-01-09 21:21:53,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:21:53,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -942049643, now seen corresponding path program 5 times [2025-01-09 21:21:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841038007] [2025-01-09 21:21:53,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:21:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:53,696 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:53,698 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:53,698 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:21:53,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:53,834 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:21:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841038007] [2025-01-09 21:21:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841038007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234914612] [2025-01-09 21:21:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:53,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:53,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:53,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:53,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:53,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 96 transitions, 588 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:53,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:53,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:53,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:54,143 INFO L124 PetriNetUnfolderBase]: 64/508 cut-off events. [2025-01-09 21:21:54,143 INFO L125 PetriNetUnfolderBase]: For 1096/1106 co-relation queries the response was YES. [2025-01-09 21:21:54,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 508 events. 64/508 cut-off events. For 1096/1106 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3390 event pairs, 9 based on Foata normal form. 8/504 useless extension candidates. Maximal degree in co-relation 1381. Up to 80 conditions per place. [2025-01-09 21:21:54,146 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 22 selfloop transitions, 16 changer transitions 8/98 dead transitions. [2025-01-09 21:21:54,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 645 flow [2025-01-09 21:21:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:21:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:21:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 514 transitions. [2025-01-09 21:21:54,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.803125 [2025-01-09 21:21:54,151 INFO L175 Difference]: Start difference. First operand has 108 places, 96 transitions, 588 flow. Second operand 10 states and 514 transitions. [2025-01-09 21:21:54,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 645 flow [2025-01-09 21:21:54,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 608 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-09 21:21:54,160 INFO L231 Difference]: Finished difference. Result has 111 places, 86 transitions, 471 flow [2025-01-09 21:21:54,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=471, PETRI_PLACES=111, PETRI_TRANSITIONS=86} [2025-01-09 21:21:54,160 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 49 predicate places. [2025-01-09 21:21:54,160 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 86 transitions, 471 flow [2025-01-09 21:21:54,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:54,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:54,161 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] [2025-01-09 21:21:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:21:54,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:54,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash 768173201, now seen corresponding path program 6 times [2025-01-09 21:21:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:54,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507785329] [2025-01-09 21:21:54,162 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:21:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:54,174 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:54,175 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:54,175 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:21:54,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:54,282 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:21:54,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:54,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507785329] [2025-01-09 21:21:54,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507785329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:54,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:54,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:54,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547248071] [2025-01-09 21:21:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:54,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:54,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:54,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:54,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:54,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 86 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:54,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:54,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:54,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:54,578 INFO L124 PetriNetUnfolderBase]: 60/468 cut-off events. [2025-01-09 21:21:54,578 INFO L125 PetriNetUnfolderBase]: For 952/964 co-relation queries the response was YES. [2025-01-09 21:21:54,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 468 events. 60/468 cut-off events. For 952/964 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3015 event pairs, 13 based on Foata normal form. 10/465 useless extension candidates. Maximal degree in co-relation 1292. Up to 72 conditions per place. [2025-01-09 21:21:54,580 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 22 selfloop transitions, 17 changer transitions 12/103 dead transitions. [2025-01-09 21:21:54,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 103 transitions, 691 flow [2025-01-09 21:21:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:21:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:21:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 460 transitions. [2025-01-09 21:21:54,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2025-01-09 21:21:54,582 INFO L175 Difference]: Start difference. First operand has 111 places, 86 transitions, 471 flow. Second operand 9 states and 460 transitions. [2025-01-09 21:21:54,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 103 transitions, 691 flow [2025-01-09 21:21:54,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 587 flow, removed 15 selfloop flow, removed 14 redundant places. [2025-01-09 21:21:54,585 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 448 flow [2025-01-09 21:21:54,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2025-01-09 21:21:54,586 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 42 predicate places. [2025-01-09 21:21:54,587 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 448 flow [2025-01-09 21:21:54,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:54,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:54,587 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] [2025-01-09 21:21:54,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:21:54,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:54,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash -77072579, now seen corresponding path program 7 times [2025-01-09 21:21:54,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:54,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401258345] [2025-01-09 21:21:54,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:21:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:54,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:54,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:54,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:54,695 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:21:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401258345] [2025-01-09 21:21:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401258345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776276206] [2025-01-09 21:21:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:54,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:54,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:54,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:54,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:54,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:54,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:54,984 INFO L124 PetriNetUnfolderBase]: 28/295 cut-off events. [2025-01-09 21:21:54,984 INFO L125 PetriNetUnfolderBase]: For 434/440 co-relation queries the response was YES. [2025-01-09 21:21:54,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 295 events. 28/295 cut-off events. For 434/440 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1524 event pairs, 5 based on Foata normal form. 5/294 useless extension candidates. Maximal degree in co-relation 758. Up to 44 conditions per place. [2025-01-09 21:21:54,985 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 14 selfloop transitions, 10 changer transitions 7/83 dead transitions. [2025-01-09 21:21:54,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 83 transitions, 465 flow [2025-01-09 21:21:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:21:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:21:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 455 transitions. [2025-01-09 21:21:54,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7899305555555556 [2025-01-09 21:21:54,988 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 448 flow. Second operand 9 states and 455 transitions. [2025-01-09 21:21:54,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 83 transitions, 465 flow [2025-01-09 21:21:54,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 83 transitions, 408 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-01-09 21:21:54,991 INFO L231 Difference]: Finished difference. Result has 94 places, 72 transitions, 302 flow [2025-01-09 21:21:54,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=302, PETRI_PLACES=94, PETRI_TRANSITIONS=72} [2025-01-09 21:21:54,992 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 32 predicate places. [2025-01-09 21:21:54,992 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 72 transitions, 302 flow [2025-01-09 21:21:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:54,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:54,993 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] [2025-01-09 21:21:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:21:54,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -559732011, now seen corresponding path program 8 times [2025-01-09 21:21:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060423035] [2025-01-09 21:21:54,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:21:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:55,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:55,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:55,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:21:55,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:55,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:21:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060423035] [2025-01-09 21:21:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060423035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605118498] [2025-01-09 21:21:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:55,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:55,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:55,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:55,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 72 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:55,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:55,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:55,283 INFO L124 PetriNetUnfolderBase]: 26/267 cut-off events. [2025-01-09 21:21:55,283 INFO L125 PetriNetUnfolderBase]: For 297/305 co-relation queries the response was YES. [2025-01-09 21:21:55,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 267 events. 26/267 cut-off events. For 297/305 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1288 event pairs, 3 based on Foata normal form. 7/266 useless extension candidates. Maximal degree in co-relation 648. Up to 38 conditions per place. [2025-01-09 21:21:55,284 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 10 selfloop transitions, 10 changer transitions 12/84 dead transitions. [2025-01-09 21:21:55,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 84 transitions, 431 flow [2025-01-09 21:21:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:21:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 21:21:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 408 transitions. [2025-01-09 21:21:55,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796875 [2025-01-09 21:21:55,285 INFO L175 Difference]: Start difference. First operand has 94 places, 72 transitions, 302 flow. Second operand 8 states and 408 transitions. [2025-01-09 21:21:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 84 transitions, 431 flow [2025-01-09 21:21:55,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 84 transitions, 373 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-01-09 21:21:55,287 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 289 flow [2025-01-09 21:21:55,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=289, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-01-09 21:21:55,288 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2025-01-09 21:21:55,288 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 289 flow [2025-01-09 21:21:55,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:55,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:55,289 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] [2025-01-09 21:21:55,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:21:55,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:55,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1368144959, now seen corresponding path program 9 times [2025-01-09 21:21:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271863241] [2025-01-09 21:21:55,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:21:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:55,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:55,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:55,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:21:55,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:55,369 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:21:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271863241] [2025-01-09 21:21:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271863241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:55,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:55,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381266308] [2025-01-09 21:21:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:55,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:55,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:55,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:55,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:55,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 289 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:55,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:55,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:55,507 INFO L124 PetriNetUnfolderBase]: 23/229 cut-off events. [2025-01-09 21:21:55,507 INFO L125 PetriNetUnfolderBase]: For 290/296 co-relation queries the response was YES. [2025-01-09 21:21:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 229 events. 23/229 cut-off events. For 290/296 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1040 event pairs, 4 based on Foata normal form. 4/227 useless extension candidates. Maximal degree in co-relation 549. Up to 32 conditions per place. [2025-01-09 21:21:55,508 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 8 selfloop transitions, 12 changer transitions 3/75 dead transitions. [2025-01-09 21:21:55,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 353 flow [2025-01-09 21:21:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:21:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 21:21:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 400 transitions. [2025-01-09 21:21:55,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78125 [2025-01-09 21:21:55,509 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 289 flow. Second operand 8 states and 400 transitions. [2025-01-09 21:21:55,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 353 flow [2025-01-09 21:21:55,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 75 transitions, 312 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-09 21:21:55,511 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 280 flow [2025-01-09 21:21:55,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=280, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2025-01-09 21:21:55,511 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 21 predicate places. [2025-01-09 21:21:55,511 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 280 flow [2025-01-09 21:21:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:55,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:55,512 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] [2025-01-09 21:21:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:21:55,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:21:55,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1169499965, now seen corresponding path program 10 times [2025-01-09 21:21:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438708384] [2025-01-09 21:21:55,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:21:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:55,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 21:21:55,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-01-09 21:21:55,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:21:55,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:55,581 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:21:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438708384] [2025-01-09 21:21:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438708384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:55,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:21:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958122054] [2025-01-09 21:21:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:55,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:21:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:55,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:21:55,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:21:55,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-01-09 21:21:55,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:55,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:55,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-01-09 21:21:55,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:55,685 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2025-01-09 21:21:55,686 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-09 21:21:55,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 72 events. 5/72 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 1 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 152. Up to 9 conditions per place. [2025-01-09 21:21:55,686 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 0 selfloop transitions, 0 changer transitions 48/48 dead transitions. [2025-01-09 21:21:55,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 48 transitions, 193 flow [2025-01-09 21:21:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:21:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:21:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 345 transitions. [2025-01-09 21:21:55,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7700892857142857 [2025-01-09 21:21:55,687 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 280 flow. Second operand 7 states and 345 transitions. [2025-01-09 21:21:55,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 48 transitions, 193 flow [2025-01-09 21:21:55,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 149 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-01-09 21:21:55,688 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2025-01-09 21:21:55,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2025-01-09 21:21:55,688 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2025-01-09 21:21:55,688 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2025-01-09 21:21:55,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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:21:55,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-01-09 21:21:55,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:21:55,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 21:21:55,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-01-09 21:21:55,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:21:55,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:21:55,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:21:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:21:55,691 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2025-01-09 21:21:55,694 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:21:55,694 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:21:55,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:21:55 BasicIcfg [2025-01-09 21:21:55,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:21:55,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:21:55,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:21:55,698 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:21:55,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:51" (3/4) ... [2025-01-09 21:21:55,700 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:21:55,702 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-09 21:21:55,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 21:21:55,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:21:55,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:21:55,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:21:55,747 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:21:55,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:21:55,747 INFO L158 Benchmark]: Toolchain (without parser) took 5386.72ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.1MB in the beginning and 229.9MB in the end (delta: -117.8MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2025-01-09 21:21:55,748 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory was 123.0MB in the beginning and 122.7MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:55,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.23ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 84.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:21:55,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.97ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:55,748 INFO L158 Benchmark]: Boogie Preprocessor took 23.88ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:21:55,748 INFO L158 Benchmark]: RCFGBuilder took 250.65ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 68.5MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:21:55,748 INFO L158 Benchmark]: TraceAbstraction took 4547.66ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 68.0MB in the beginning and 238.4MB in the end (delta: -170.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2025-01-09 21:21:55,749 INFO L158 Benchmark]: Witness Printer took 48.75ms. Allocated memory is still 402.7MB. Free memory was 238.4MB in the beginning and 229.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:21:55,750 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.26ms. Allocated memory is still 201.3MB. Free memory was 123.0MB in the beginning and 122.7MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.23ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 84.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.97ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.88ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 250.65ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 68.5MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4547.66ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 68.0MB in the beginning and 238.4MB in the end (delta: -170.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 48.75ms. Allocated memory is still 402.7MB. Free memory was 238.4MB in the beginning and 229.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 921]: 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 3 procedures, 88 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 1153 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1699 IncrementalHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 149 mSDtfsCounter, 1699 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588occurred in iteration=7, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 454 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:21:55,761 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