/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread/lazy01.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:11:09,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:11:09,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:11:09,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:11:09,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:11:09,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:11:09,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:11:09,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:11:09,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:11:09,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:11:09,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:11:09,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:11:09,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:11:09,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:11:09,362 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:11:09,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:11:09,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:09,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:11:09,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:09,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:11:09,364 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:11:09,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:11:09,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:11:09,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:11:09,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:11:09,653 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:11:09,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/lazy01.i [2025-04-13 19:11:10,969 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe377e05/76d33627a12a4029ac388c5e5415fc0d/FLAGf4a6d5b6f [2025-04-13 19:11:11,179 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:11:11,180 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/lazy01.i [2025-04-13 19:11:11,188 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe377e05/76d33627a12a4029ac388c5e5415fc0d/FLAGf4a6d5b6f [2025-04-13 19:11:12,020 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe377e05/76d33627a12a4029ac388c5e5415fc0d [2025-04-13 19:11:12,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:11:12,023 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:11:12,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:11:12,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:11:12,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:11:12,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12, skipping insertion in model container [2025-04-13 19:11:12,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:11:12,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/lazy01.i[31042,31055] [2025-04-13 19:11:12,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:11:12,355 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:11:12,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/lazy01.i[31042,31055] [2025-04-13 19:11:12,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:11:12,426 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:11:12,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12 WrapperNode [2025-04-13 19:11:12,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:11:12,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:11:12,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:11:12,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:11:12,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,456 INFO L138 Inliner]: procedures = 169, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-04-13 19:11:12,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:11:12,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:11:12,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:11:12,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:11:12,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,479 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 19:11:12,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:11:12,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:11:12,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:11:12,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:11:12,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (1/1) ... [2025-04-13 19:11:12,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:12,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:11:12,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:11:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:11:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:11:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:11:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:11:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:11:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:11:12,542 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:11:12,624 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:11:12,625 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:11:12,723 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:11:12,724 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:11:12,724 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:11:12,812 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:11:12,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:11:12 BoogieIcfgContainer [2025-04-13 19:11:12,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:11:12,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:11:12,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:11:12,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:11:12,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:11:12" (1/3) ... [2025-04-13 19:11:12,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4717354a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:11:12, skipping insertion in model container [2025-04-13 19:11:12,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:12" (2/3) ... [2025-04-13 19:11:12,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4717354a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:11:12, skipping insertion in model container [2025-04-13 19:11:12,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:11:12" (3/3) ... [2025-04-13 19:11:12,821 INFO L128 eAbstractionObserver]: Analyzing ICFG lazy01.i [2025-04-13 19:11:12,830 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:11:12,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lazy01.i that has 4 procedures, 31 locations, 27 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:11:12,832 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:11:12,869 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:11:12,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 81 flow [2025-04-13 19:11:12,919 INFO L116 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-04-13 19:11:12,921 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:11:12,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 0/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:11:12,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 30 transitions, 81 flow [2025-04-13 19:11:12,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 22 transitions, 59 flow [2025-04-13 19:11:12,932 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:11:12,939 INFO L340 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;@4e2d05e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:11:12,939 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:11:12,947 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:11:12,947 INFO L116 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-04-13 19:11:12,948 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:11:12,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:12,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:12,948 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:11:12,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1496274049, now seen corresponding path program 1 times [2025-04-13 19:11:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:12,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013296272] [2025-04-13 19:11:12,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:11:13,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:11:13,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:13,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:13,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013296272] [2025-04-13 19:11:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013296272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:11:13,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:11:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:11:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758753569] [2025-04-13 19:11:13,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:11:13,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:11:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:13,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:11:13,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:11:13,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-04-13 19:11:13,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-04-13 19:11:13,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:13,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-04-13 19:11:13,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:13,343 INFO L116 PetriNetUnfolderBase]: 358/586 cut-off events. [2025-04-13 19:11:13,343 INFO L117 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-04-13 19:11:13,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 586 events. 358/586 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2449 event pairs, 124 based on Foata normal form. 8/592 useless extension candidates. Maximal degree in co-relation 1137. Up to 524 conditions per place. [2025-04-13 19:11:13,352 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 26 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-04-13 19:11:13,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 143 flow [2025-04-13 19:11:13,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:11:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:11:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-13 19:11:13,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-13 19:11:13,366 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 59 flow. Second operand 3 states and 48 transitions. [2025-04-13 19:11:13,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 143 flow [2025-04-13 19:11:13,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 19:11:13,377 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2025-04-13 19:11:13,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-13 19:11:13,382 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2025-04-13 19:11:13,382 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2025-04-13 19:11:13,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-04-13 19:11:13,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:13,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:13,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:11:13,383 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:11:13,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 774018637, now seen corresponding path program 1 times [2025-04-13 19:11:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:13,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094960364] [2025-04-13 19:11:13,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:13,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:11:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:11:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:13,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094960364] [2025-04-13 19:11:13,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094960364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:11:13,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:11:13,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:11:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254296557] [2025-04-13 19:11:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:11:13,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:11:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:13,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:11:13,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:11:13,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-04-13 19:11:13,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04-13 19:11:13,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:13,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-04-13 19:11:13,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:13,611 INFO L116 PetriNetUnfolderBase]: 155/305 cut-off events. [2025-04-13 19:11:13,611 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-13 19:11:13,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 305 events. 155/305 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1119 event pairs, 38 based on Foata normal form. 64/365 useless extension candidates. Maximal degree in co-relation 398. Up to 205 conditions per place. [2025-04-13 19:11:13,613 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 25 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-04-13 19:11:13,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 152 flow [2025-04-13 19:11:13,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:11:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:11:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 19:11:13,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2025-04-13 19:11:13,616 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 3 states and 49 transitions. [2025-04-13 19:11:13,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 152 flow [2025-04-13 19:11:13,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:11:13,617 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 76 flow [2025-04-13 19:11:13,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2025-04-13 19:11:13,617 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-04-13 19:11:13,617 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 76 flow [2025-04-13 19:11:13,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04-13 19:11:13,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:13,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:13,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:11:13,618 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:11:13,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash 262066687, now seen corresponding path program 1 times [2025-04-13 19:11:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:13,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49940681] [2025-04-13 19:11:13,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:11:13,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:11:13,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:13,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:13,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49940681] [2025-04-13 19:11:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49940681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:11:13,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:11:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:11:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916438290] [2025-04-13 19:11:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:11:13,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:11:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:13,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:11:13,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:11:13,698 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-04-13 19:11:13,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-04-13 19:11:13,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:13,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-04-13 19:11:13,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:13,789 INFO L116 PetriNetUnfolderBase]: 150/294 cut-off events. [2025-04-13 19:11:13,789 INFO L117 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-04-13 19:11:13,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 294 events. 150/294 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1063 event pairs, 41 based on Foata normal form. 5/298 useless extension candidates. Maximal degree in co-relation 280. Up to 197 conditions per place. [2025-04-13 19:11:13,791 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 30 selfloop transitions, 4 changer transitions 2/39 dead transitions. [2025-04-13 19:11:13,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 194 flow [2025-04-13 19:11:13,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:11:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:11:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-13 19:11:13,793 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2025-04-13 19:11:13,793 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 76 flow. Second operand 4 states and 61 transitions. [2025-04-13 19:11:13,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 194 flow [2025-04-13 19:11:13,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:11:13,795 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 83 flow [2025-04-13 19:11:13,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2025-04-13 19:11:13,796 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-04-13 19:11:13,796 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 83 flow [2025-04-13 19:11:13,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-04-13 19:11:13,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:13,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:13,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:11:13,797 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:11:13,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1872841535, now seen corresponding path program 1 times [2025-04-13 19:11:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:13,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20013779] [2025-04-13 19:11:13,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:13,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:11:13,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:11:13,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:13,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:13,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20013779] [2025-04-13 19:11:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20013779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:11:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:11:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:11:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903523355] [2025-04-13 19:11:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:11:13,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:11:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:13,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:11:13,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:11:13,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-04-13 19:11:13,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-04-13 19:11:13,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:13,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-04-13 19:11:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:13,930 INFO L116 PetriNetUnfolderBase]: 146/286 cut-off events. [2025-04-13 19:11:13,931 INFO L117 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-04-13 19:11:13,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 286 events. 146/286 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1021 event pairs, 35 based on Foata normal form. 4/289 useless extension candidates. Maximal degree in co-relation 282. Up to 142 conditions per place. [2025-04-13 19:11:13,932 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 31 selfloop transitions, 5 changer transitions 2/41 dead transitions. [2025-04-13 19:11:13,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 205 flow [2025-04-13 19:11:13,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:11:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:11:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-13 19:11:13,935 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-13 19:11:13,935 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 83 flow. Second operand 4 states and 63 transitions. [2025-04-13 19:11:13,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 205 flow [2025-04-13 19:11:13,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 197 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:11:13,938 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 91 flow [2025-04-13 19:11:13,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-13 19:11:13,940 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-04-13 19:11:13,940 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 91 flow [2025-04-13 19:11:13,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-04-13 19:11:13,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:13,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:13,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:11:13,940 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:11:13,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1886895555, now seen corresponding path program 1 times [2025-04-13 19:11:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:13,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830032825] [2025-04-13 19:11:13,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:13,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:11:13,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:11:13,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:13,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:11:13,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:11:13,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:11:13,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:11:13,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:13,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:11:13,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:11:13,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:11:13,991 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:11:13,992 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:11:13,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:11:13,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:11:13,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 19:11:13,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:11:13,993 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 19:11:14,018 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:11:14,019 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:11:14,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:11:14 BasicIcfg [2025-04-13 19:11:14,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:11:14,022 INFO L158 Benchmark]: Toolchain (without parser) took 1999.64ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 70.1MB in the end (delta: 29.3MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2025-04-13 19:11:14,023 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:11:14,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.90ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 74.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:11:14,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.84ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 73.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:11:14,023 INFO L158 Benchmark]: Boogie Preprocessor took 33.47ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:11:14,024 INFO L158 Benchmark]: RCFGBuilder took 322.37ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 46.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:11:14,024 INFO L158 Benchmark]: TraceAbstraction took 1208.02ms. Allocated memory is still 142.6MB. Free memory was 46.1MB in the beginning and 70.1MB in the end (delta: -24.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:11:14,025 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.20ms. Allocated memory is still 163.6MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 402.90ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 74.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.84ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 73.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.47ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 322.37ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 46.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1208.02ms. Allocated memory is still 142.6MB. Free memory was 46.1MB in the beginning and 70.1MB in the end (delta: -24.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(arg, Pre)={0:0}, data=0, mutex={3:0}, t1=-1] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0, t3=1] [L707] 1 data++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 [L722] 3 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 53 locations, 52 edges, 5 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: 1.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 0 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-13 19:11:14,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...