/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/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:00:36,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:00:36,349 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 21:00:36,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:00:36,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:00:36,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:00:36,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:00:36,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:00:36,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:00:36,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:00:36,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:00:36,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:00:36,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:00:36,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:00:36,386 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:00:36,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:00:36,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:00:36,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:00:36,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:00:36,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:36,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:36,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:00:36,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:36,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:00:36,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:00:36,389 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 21:00:36,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:00:36,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:00:36,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:00:36,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:00:36,621 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:00:36,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2025-04-13 21:00:38,008 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaacf106/40800c05c87c49ff82485db08e6ee130/FLAGf0416c2cd [2025-04-13 21:00:38,223 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:00:38,223 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2025-04-13 21:00:38,232 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaacf106/40800c05c87c49ff82485db08e6ee130/FLAGf0416c2cd [2025-04-13 21:00:39,009 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaacf106/40800c05c87c49ff82485db08e6ee130 [2025-04-13 21:00:39,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:00:39,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:00:39,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:39,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:00:39,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:00:39,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d205de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39, skipping insertion in model container [2025-04-13 21:00:39,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:00:39,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2025-04-13 21:00:39,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:39,236 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:00:39,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2025-04-13 21:00:39,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:39,288 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:00:39,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39 WrapperNode [2025-04-13 21:00:39,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:39,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:39,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:00:39,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:00:39,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,325 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 148 [2025-04-13 21:00:39,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:39,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:00:39,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:00:39,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:00:39,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,355 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 21:00:39,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:00:39,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:00:39,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:00:39,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:00:39,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (1/1) ... [2025-04-13 21:00:39,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:39,412 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 21:00:39,417 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 21:00:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:00:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:00:39,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:00:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:00:39,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:00:39,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:00:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:00:39,436 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 21:00:39,517 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:00:39,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:00:39,743 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:00:39,744 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:00:39,744 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:00:39,992 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:00:39,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:39 BoogieIcfgContainer [2025-04-13 21:00:39,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:00:39,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:00:39,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:00:39,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:00:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:00:39" (1/3) ... [2025-04-13 21:00:40,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344e64a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:40, skipping insertion in model container [2025-04-13 21:00:40,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:39" (2/3) ... [2025-04-13 21:00:40,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344e64a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:40, skipping insertion in model container [2025-04-13 21:00:40,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:39" (3/3) ... [2025-04-13 21:00:40,003 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-04-13 21:00:40,014 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:00:40,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:00:40,016 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:00:40,068 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:00:40,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:00:40,130 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 21:00:40,132 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 21:00:40,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:00:40,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-13 21:00:40,140 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:00:40,149 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;@749e3259, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:00:40,149 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:00:40,159 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:00:40,159 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-13 21:00:40,160 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:40,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:40,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:40,161 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:40,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1695781278, now seen corresponding path program 1 times [2025-04-13 21:00:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:40,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302318107] [2025-04-13 21:00:40,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:40,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:00:40,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:00:40,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:40,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:40,415 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 21:00:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:40,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302318107] [2025-04-13 21:00:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302318107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:40,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:00:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771195386] [2025-04-13 21:00:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:40,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:40,448 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:40,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21:00:40,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:40,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:40,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:40,544 INFO L116 PetriNetUnfolderBase]: 69/124 cut-off events. [2025-04-13 21:00:40,544 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 21:00:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 124 events. 69/124 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 317 event pairs, 22 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-04-13 21:00:40,546 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-13 21:00:40,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 27 transitions, 129 flow [2025-04-13 21:00:40,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 21:00:40,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-13 21:00:40,558 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 34 transitions. [2025-04-13 21:00:40,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 27 transitions, 129 flow [2025-04-13 21:00:40,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:40,563 INFO L231 Difference]: Finished difference. Result has 19 places, 18 transitions, 55 flow [2025-04-13 21:00:40,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=19, PETRI_TRANSITIONS=18} [2025-04-13 21:00:40,567 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-13 21:00:40,567 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 18 transitions, 55 flow [2025-04-13 21:00:40,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21:00:40,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:40,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:40,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:00:40,568 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:40,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2113042845, now seen corresponding path program 1 times [2025-04-13 21:00:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:40,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268569084] [2025-04-13 21:00:40,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:40,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:00:40,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:00:40,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:40,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:40,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:40,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268569084] [2025-04-13 21:00:40,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268569084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:40,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:00:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833791662] [2025-04-13 21:00:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:40,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:40,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:40,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:40,743 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:40,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21:00:40,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:40,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:40,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:40,806 INFO L116 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-04-13 21:00:40,806 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-13 21:00:40,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 125 events. 69/125 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 298 event pairs, 44 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-04-13 21:00:40,807 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-13 21:00:40,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 95 flow [2025-04-13 21:00:40,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-13 21:00:40,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 21:00:40,810 INFO L175 Difference]: Start difference. First operand has 19 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2025-04-13 21:00:40,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 95 flow [2025-04-13 21:00:40,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 19 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:40,812 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 64 flow [2025-04-13 21:00:40,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-13 21:00:40,813 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-13 21:00:40,813 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 64 flow [2025-04-13 21:00:40,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21:00:40,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:40,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:40,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:00:40,813 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:40,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash -779790888, now seen corresponding path program 1 times [2025-04-13 21:00:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:40,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132805765] [2025-04-13 21:00:40,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:40,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:40,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:40,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:40,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:41,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132805765] [2025-04-13 21:00:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132805765] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:41,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132800782] [2025-04-13 21:00:41,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:41,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:41,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:41,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:41,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:00:41,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:41,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:41,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:41,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:41,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132800782] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:00:41,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 21:00:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491214833] [2025-04-13 21:00:41,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:41,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:41,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:41,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:00:41,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:41,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:41,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:41,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:41,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:41,310 INFO L116 PetriNetUnfolderBase]: 76/137 cut-off events. [2025-04-13 21:00:41,310 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 21:00:41,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 137 events. 76/137 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 22 based on Foata normal form. 5/141 useless extension candidates. Maximal degree in co-relation 316. Up to 71 conditions per place. [2025-04-13 21:00:41,311 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2025-04-13 21:00:41,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 33 transitions, 166 flow [2025-04-13 21:00:41,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-13 21:00:41,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 21:00:41,313 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 64 flow. Second operand 4 states and 41 transitions. [2025-04-13 21:00:41,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 33 transitions, 166 flow [2025-04-13 21:00:41,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:41,315 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 86 flow [2025-04-13 21:00:41,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 21:00:41,316 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-13 21:00:41,316 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 86 flow [2025-04-13 21:00:41,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:41,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:41,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:41,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:41,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:41,521 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:41,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 895444469, now seen corresponding path program 1 times [2025-04-13 21:00:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:41,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522263859] [2025-04-13 21:00:41,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:41,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:41,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:41,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:41,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522263859] [2025-04-13 21:00:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522263859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:41,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:00:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972039549] [2025-04-13 21:00:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:41,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:00:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:41,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:00:41,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:00:41,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:41,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:41,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:41,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:41,826 INFO L116 PetriNetUnfolderBase]: 85/165 cut-off events. [2025-04-13 21:00:41,826 INFO L117 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-04-13 21:00:41,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 165 events. 85/165 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 554 event pairs, 24 based on Foata normal form. 9/173 useless extension candidates. Maximal degree in co-relation 440. Up to 93 conditions per place. [2025-04-13 21:00:41,827 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 31 selfloop transitions, 4 changer transitions 7/42 dead transitions. [2025-04-13 21:00:41,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 241 flow [2025-04-13 21:00:41,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:00:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:00:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-13 21:00:41,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2025-04-13 21:00:41,830 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 86 flow. Second operand 5 states and 48 transitions. [2025-04-13 21:00:41,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 241 flow [2025-04-13 21:00:41,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 236 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:41,831 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 113 flow [2025-04-13 21:00:41,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-04-13 21:00:41,832 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-13 21:00:41,832 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 113 flow [2025-04-13 21:00:41,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:41,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:41,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:41,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:00:41,832 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:41,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1121465891, now seen corresponding path program 2 times [2025-04-13 21:00:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:41,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748319790] [2025-04-13 21:00:41,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:41,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:41,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:41,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:41,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:41,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748319790] [2025-04-13 21:00:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748319790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:41,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796476471] [2025-04-13 21:00:41,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:41,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:41,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:00:42,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:42,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:42,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:42,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:42,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:42,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:42,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796476471] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:00:42,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 21:00:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794064048] [2025-04-13 21:00:42,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:42,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:42,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:42,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:00:42,088 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:42,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:42,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:42,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:42,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:42,171 INFO L116 PetriNetUnfolderBase]: 87/164 cut-off events. [2025-04-13 21:00:42,171 INFO L117 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-04-13 21:00:42,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 164 events. 87/164 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 487 event pairs, 25 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 548. Up to 103 conditions per place. [2025-04-13 21:00:42,174 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 3/35 dead transitions. [2025-04-13 21:00:42,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 232 flow [2025-04-13 21:00:42,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 21:00:42,176 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-04-13 21:00:42,176 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 113 flow. Second operand 4 states and 40 transitions. [2025-04-13 21:00:42,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 232 flow [2025-04-13 21:00:42,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 219 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:42,178 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 132 flow [2025-04-13 21:00:42,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-13 21:00:42,178 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2025-04-13 21:00:42,179 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 132 flow [2025-04-13 21:00:42,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:42,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:42,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:42,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 21:00:42,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:42,382 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:42,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1087418136, now seen corresponding path program 2 times [2025-04-13 21:00:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:42,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376764081] [2025-04-13 21:00:42,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:42,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:42,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:42,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:42,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376764081] [2025-04-13 21:00:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376764081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:42,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52351165] [2025-04-13 21:00:42,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:42,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:42,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:00:42,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:42,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:42,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:42,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:42,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:42,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:42,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:00:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52351165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:42,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:00:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-04-13 21:00:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391692483] [2025-04-13 21:00:42,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:42,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:00:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:42,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:00:42,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:00:42,963 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:42,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:42,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:42,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:42,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:43,494 INFO L116 PetriNetUnfolderBase]: 96/184 cut-off events. [2025-04-13 21:00:43,494 INFO L117 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-04-13 21:00:43,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 184 events. 96/184 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 610 event pairs, 24 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 635. Up to 99 conditions per place. [2025-04-13 21:00:43,496 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 31 selfloop transitions, 9 changer transitions 9/49 dead transitions. [2025-04-13 21:00:43,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 341 flow [2025-04-13 21:00:43,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:00:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:00:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-04-13 21:00:43,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-13 21:00:43,497 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 132 flow. Second operand 6 states and 54 transitions. [2025-04-13 21:00:43,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 341 flow [2025-04-13 21:00:43,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:43,499 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 189 flow [2025-04-13 21:00:43,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-04-13 21:00:43,500 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2025-04-13 21:00:43,500 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 189 flow [2025-04-13 21:00:43,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:43,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:43,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:43,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:00:43,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:43,701 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:43,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1320262408, now seen corresponding path program 3 times [2025-04-13 21:00:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:43,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862311123] [2025-04-13 21:00:43,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:43,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:43,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:43,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:43,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:43,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862311123] [2025-04-13 21:00:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862311123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:43,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254413378] [2025-04-13 21:00:43,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:43,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:43,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:43,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:00:43,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:43,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:43,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:43,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:43,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:43,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:44,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254413378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:44,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 21:00:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887381999] [2025-04-13 21:00:44,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:44,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:00:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:44,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:00:44,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:00:44,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:44,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 189 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 21:00:44,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:44,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:44,251 INFO L116 PetriNetUnfolderBase]: 106/202 cut-off events. [2025-04-13 21:00:44,251 INFO L117 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-04-13 21:00:44,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 202 events. 106/202 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 655 event pairs, 35 based on Foata normal form. 5/206 useless extension candidates. Maximal degree in co-relation 805. Up to 129 conditions per place. [2025-04-13 21:00:44,253 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 32 selfloop transitions, 14 changer transitions 3/49 dead transitions. [2025-04-13 21:00:44,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 401 flow [2025-04-13 21:00:44,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:00:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:00:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2025-04-13 21:00:44,257 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-13 21:00:44,258 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 189 flow. Second operand 6 states and 50 transitions. [2025-04-13 21:00:44,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 401 flow [2025-04-13 21:00:44,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 379 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:44,260 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 275 flow [2025-04-13 21:00:44,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-04-13 21:00:44,261 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2025-04-13 21:00:44,261 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 275 flow [2025-04-13 21:00:44,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 21:00:44,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:44,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:44,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:44,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:44,465 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:44,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1115213139, now seen corresponding path program 3 times [2025-04-13 21:00:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:44,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372139775] [2025-04-13 21:00:44,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:44,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:44,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:44,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:44,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:44,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372139775] [2025-04-13 21:00:44,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372139775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:44,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178529748] [2025-04-13 21:00:44,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:44,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:44,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:44,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:00:44,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:44,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:44,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:44,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:44,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:44,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178529748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:44,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 21:00:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600456533] [2025-04-13 21:00:44,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:44,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:00:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:44,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:00:44,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:00:44,670 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:44,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 21:00:44,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:44,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:44,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:44,775 INFO L116 PetriNetUnfolderBase]: 107/199 cut-off events. [2025-04-13 21:00:44,775 INFO L117 PetriNetUnfolderBase]: For 575/575 co-relation queries the response was YES. [2025-04-13 21:00:44,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 199 events. 107/199 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 640 event pairs, 31 based on Foata normal form. 4/203 useless extension candidates. Maximal degree in co-relation 894. Up to 136 conditions per place. [2025-04-13 21:00:44,777 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 30 selfloop transitions, 13 changer transitions 3/46 dead transitions. [2025-04-13 21:00:44,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 429 flow [2025-04-13 21:00:44,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:00:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:00:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-13 21:00:44,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2025-04-13 21:00:44,778 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 275 flow. Second operand 5 states and 44 transitions. [2025-04-13 21:00:44,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 429 flow [2025-04-13 21:00:44,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 408 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:44,781 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 302 flow [2025-04-13 21:00:44,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2025-04-13 21:00:44,784 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2025-04-13 21:00:44,785 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 302 flow [2025-04-13 21:00:44,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 21:00:44,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:44,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:44,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:00:44,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:44,989 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:44,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2121639134, now seen corresponding path program 4 times [2025-04-13 21:00:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:44,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246778333] [2025-04-13 21:00:44,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:44,995 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:45,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:45,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:45,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:45,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246778333] [2025-04-13 21:00:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246778333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:45,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:45,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:00:45,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934339418] [2025-04-13 21:00:45,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:45,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:00:45,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:45,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:00:45,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:00:45,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:45,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:45,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:45,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:45,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:45,167 INFO L116 PetriNetUnfolderBase]: 95/168 cut-off events. [2025-04-13 21:00:45,168 INFO L117 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-04-13 21:00:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 168 events. 95/168 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 469 event pairs, 18 based on Foata normal form. 2/169 useless extension candidates. Maximal degree in co-relation 787. Up to 89 conditions per place. [2025-04-13 21:00:45,169 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 34 selfloop transitions, 15 changer transitions 3/52 dead transitions. [2025-04-13 21:00:45,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 506 flow [2025-04-13 21:00:45,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:00:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:00:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-13 21:00:45,171 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2025-04-13 21:00:45,171 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 302 flow. Second operand 6 states and 46 transitions. [2025-04-13 21:00:45,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 506 flow [2025-04-13 21:00:45,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 470 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:45,175 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 348 flow [2025-04-13 21:00:45,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-13 21:00:45,175 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2025-04-13 21:00:45,175 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 348 flow [2025-04-13 21:00:45,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:45,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:45,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:45,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:00:45,176 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:45,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 531812573, now seen corresponding path program 1 times [2025-04-13 21:00:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:45,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345837983] [2025-04-13 21:00:45,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:45,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:00:45,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:00:45,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:00:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:45,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345837983] [2025-04-13 21:00:45,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345837983] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:45,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959278147] [2025-04-13 21:00:45,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:45,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:45,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:45,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:45,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:00:45,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:00:45,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:00:45,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:45,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 21:00:45,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:45,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:00:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:45,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:46,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 374 [2025-04-13 21:00:46,567 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:00:46,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 3753 treesize of output 2381 [2025-04-13 21:01:46,677 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:01:47,543 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:01:48,470 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:01:50,965 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:01:53,423 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-13 21:02:04,067 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:09,842 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:11,911 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:13,557 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:02:36,005 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:02:36,591 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:38,347 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:40,417 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:43,807 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:48,438 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:02:51,777 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:02:52,328 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:04,755 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:08,134 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-13 21:03:14,801 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:16,552 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:19,179 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:23,008 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:27,921 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:32,972 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:34,581 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:36,321 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:38,182 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:39,921 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:41,478 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:42,948 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:43,602 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:44,385 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:45,983 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:50,183 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-13 21:03:58,995 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:04:03,899 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:04:05,667 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:07,406 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:08,085 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:10,464 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:04:12,222 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:14,112 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:14,786 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:16,963 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:04:18,767 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:20,527 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:21,212 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:31,832 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:32,890 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:36,112 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:36,679 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:38,774 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:40,222 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:43,079 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:43,934 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:46,090 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:49,477 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:52,138 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:52,855 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:53,500 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:04:56,517 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:58,917 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:02,962 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:04,302 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:07,301 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:09,501 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:11,553 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:12,507 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:46,209 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:57,909 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 21:05:57,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 21:05:57,910 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 21:05:57,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 21:05:58,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:58,111 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 21:05:58,115 INFO L158 Benchmark]: Toolchain (without parser) took 319102.84ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 108.9MB in the beginning and 876.7MB in the end (delta: -767.8MB). Peak memory consumption was 704.3MB. Max. memory is 8.0GB. [2025-04-13 21:05:58,115 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:05:58,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.15ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 93.5MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:05:58,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:05:58,116 INFO L158 Benchmark]: Boogie Preprocessor took 54.13ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:05:58,116 INFO L158 Benchmark]: RCFGBuilder took 612.29ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 33.3MB in the end (delta: 56.1MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2025-04-13 21:05:58,116 INFO L158 Benchmark]: TraceAbstraction took 318120.29ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 32.7MB in the beginning and 876.7MB in the end (delta: -844.0MB). Peak memory consumption was 628.8MB. Max. memory is 8.0GB. [2025-04-13 21:05:58,118 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.19ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.15ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 93.5MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.13ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 612.29ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 33.3MB in the end (delta: 56.1MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * TraceAbstraction took 318120.29ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 32.7MB in the beginning and 876.7MB in the end (delta: -844.0MB). Peak memory consumption was 628.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...