/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:37:33,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:37:33,628 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-14 01:37:33,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:37:33,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:37:33,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:37:33,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:37:33,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:37:33,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:37:33,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:37:33,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:37:33,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:37:33,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:37:33,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:37:33,658 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:37:33,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:37:33,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:37:33,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:37:33,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:37:33,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:37:33,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:37:33,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:37:33,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:37:33,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:37:33,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:37:33,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:37:33,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:37:33,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:37:33,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:37:33,662 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:37:33,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:37:33,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:37:33,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:37:33,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:37:33,910 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:37:33,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2025-04-14 01:37:35,222 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac29ee80/0fa0bb5c560f47c7909610044ce064ae/FLAGedb6cf6c4 [2025-04-14 01:37:35,408 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:37:35,409 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2025-04-14 01:37:35,415 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac29ee80/0fa0bb5c560f47c7909610044ce064ae/FLAGedb6cf6c4 [2025-04-14 01:37:36,272 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac29ee80/0fa0bb5c560f47c7909610044ce064ae [2025-04-14 01:37:36,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:37:36,275 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:37:36,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:37:36,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:37:36,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:37:36,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b3ea17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36, skipping insertion in model container [2025-04-14 01:37:36,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:37:36,444 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-4.wvr.c[2598,2611] [2025-04-14 01:37:36,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:37:36,457 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:37:36,484 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-4.wvr.c[2598,2611] [2025-04-14 01:37:36,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:37:36,497 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:37:36,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36 WrapperNode [2025-04-14 01:37:36,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:37:36,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:37:36,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:37:36,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:37:36,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,522 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 138 [2025-04-14 01:37:36,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:37:36,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:37:36,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:37:36,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:37:36,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,554 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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-14 01:37:36,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:37:36,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:37:36,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:37:36,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:37:36,579 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (1/1) ... [2025-04-14 01:37:36,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:37:36,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:36,606 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-14 01:37:36,608 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-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:37:36,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:37:36,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:37:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:37:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:37:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:37:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:37:36,627 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:37:36,698 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:37:36,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:37:36,939 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:37:36,940 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:37:36,940 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:37:37,176 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:37:37,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:37:37 BoogieIcfgContainer [2025-04-14 01:37:37,177 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:37:37,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:37:37,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:37:37,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:37:37,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:37:36" (1/3) ... [2025-04-14 01:37:37,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f13fbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:37:37, skipping insertion in model container [2025-04-14 01:37:37,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:36" (2/3) ... [2025-04-14 01:37:37,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f13fbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:37:37, skipping insertion in model container [2025-04-14 01:37:37,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:37:37" (3/3) ... [2025-04-14 01:37:37,186 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2025-04-14 01:37:37,198 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:37:37,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-4.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:37:37,200 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:37:37,259 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:37:37,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-14 01:37:37,316 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-14 01:37:37,318 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:37:37,322 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-14 01:37:37,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-14 01:37:37,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-14 01:37:37,333 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:37:37,343 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;@22e7f9a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:37:37,343 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:37:37,350 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:37:37,351 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-14 01:37:37,351 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:37:37,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:37,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:37,352 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-14 01:37:37,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2019197150, now seen corresponding path program 1 times [2025-04-14 01:37:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:37,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572082805] [2025-04-14 01:37:37,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:37,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:37,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:37:37,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:37:37,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:37,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:37,580 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-14 01:37:37,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:37,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572082805] [2025-04-14 01:37:37,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572082805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:37,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:37,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:37:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660866833] [2025-04-14 01:37:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:37,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:37:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:37,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:37:37,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:37:37,608 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:37,610 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-14 01:37:37,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:37,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:37,686 INFO L116 PetriNetUnfolderBase]: 69/124 cut-off events. [2025-04-14 01:37:37,686 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-14 01:37:37,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 124 events. 69/124 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 318 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-14 01:37:37,688 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-14 01:37:37,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 27 transitions, 129 flow [2025-04-14 01:37:37,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:37:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:37:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-14 01:37:37,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-14 01:37:37,701 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 34 transitions. [2025-04-14 01:37:37,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 27 transitions, 129 flow [2025-04-14 01:37:37,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:37:37,707 INFO L231 Difference]: Finished difference. Result has 19 places, 18 transitions, 55 flow [2025-04-14 01:37:37,709 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-14 01:37:37,712 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-14 01:37:37,712 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 18 transitions, 55 flow [2025-04-14 01:37:37,712 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-14 01:37:37,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:37,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:37,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:37:37,713 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-14 01:37:37,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash 67789034, now seen corresponding path program 1 times [2025-04-14 01:37:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:37,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698305276] [2025-04-14 01:37:37,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:37:37,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:37:37,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:37,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:37,854 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-14 01:37:37,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:37,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698305276] [2025-04-14 01:37:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698305276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:37,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:37,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:37:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532352109] [2025-04-14 01:37:37,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:37,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:37:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:37,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:37:37,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:37:37,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:37,856 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-14 01:37:37,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:37,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:37,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:37,922 INFO L116 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-04-14 01:37:37,922 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 01:37:37,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 125 events. 69/125 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 305 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-14 01:37:37,923 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-14 01:37:37,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 95 flow [2025-04-14 01:37:37,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:37:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:37:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-14 01:37:37,926 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-14 01:37:37,926 INFO L175 Difference]: Start difference. First operand has 19 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2025-04-14 01:37:37,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 95 flow [2025-04-14 01:37:37,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 19 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:37,927 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 64 flow [2025-04-14 01:37:37,927 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-14 01:37:37,928 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-14 01:37:37,928 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 64 flow [2025-04-14 01:37:37,928 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-14 01:37:37,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:37,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:37,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:37:37,928 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-14 01:37:37,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash -943286538, now seen corresponding path program 1 times [2025-04-14 01:37:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:37,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913755201] [2025-04-14 01:37:37,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:37,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:37:37,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:37,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:37,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:38,152 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-14 01:37:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:38,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913755201] [2025-04-14 01:37:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913755201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:38,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601144302] [2025-04-14 01:37:38,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:38,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:38,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:38,156 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-14 01:37:38,158 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-14 01:37:38,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:37:38,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:38,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:38,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:38,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:38,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:38,271 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-14 01:37:38,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:38,319 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-14 01:37:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601144302] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:38,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:37:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-14 01:37:38,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847906789] [2025-04-14 01:37:38,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:38,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:37:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:38,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:37:38,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:37:38,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:38,321 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-14 01:37:38,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:38,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:38,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:38,411 INFO L116 PetriNetUnfolderBase]: 76/137 cut-off events. [2025-04-14 01:37:38,411 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-14 01:37:38,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 137 events. 76/137 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. 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-14 01:37:38,413 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2025-04-14 01:37:38,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 33 transitions, 166 flow [2025-04-14 01:37:38,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:37:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:37:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-14 01:37:38,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-14 01:37:38,414 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 64 flow. Second operand 4 states and 41 transitions. [2025-04-14 01:37:38,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 33 transitions, 166 flow [2025-04-14 01:37:38,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:38,415 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 86 flow [2025-04-14 01:37:38,415 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-14 01:37:38,415 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-14 01:37:38,415 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 86 flow [2025-04-14 01:37:38,415 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-14 01:37:38,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:38,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:38,422 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-14 01:37:38,616 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-14 01:37:38,617 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-14 01:37:38,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1673791208, now seen corresponding path program 2 times [2025-04-14 01:37:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:38,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948682301] [2025-04-14 01:37:38,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:38,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:38,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:38,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:38,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:38,722 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-14 01:37:38,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:38,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948682301] [2025-04-14 01:37:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948682301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:38,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:37:38,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957543186] [2025-04-14 01:37:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:38,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:37:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:38,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:37:38,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:37:38,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:38,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 86 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-14 01:37:38,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:38,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:38,826 INFO L116 PetriNetUnfolderBase]: 86/159 cut-off events. [2025-04-14 01:37:38,826 INFO L117 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-04-14 01:37:38,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 159 events. 86/159 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 28 based on Foata normal form. 4/162 useless extension candidates. Maximal degree in co-relation 431. Up to 96 conditions per place. [2025-04-14 01:37:38,828 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 6 changer transitions 1/35 dead transitions. [2025-04-14 01:37:38,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 202 flow [2025-04-14 01:37:38,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:37:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:37:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-14 01:37:38,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:37:38,830 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 86 flow. Second operand 4 states and 38 transitions. [2025-04-14 01:37:38,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 202 flow [2025-04-14 01:37:38,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 197 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:38,833 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 119 flow [2025-04-14 01:37:38,833 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-14 01:37:38,833 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-14 01:37:38,833 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 119 flow [2025-04-14 01:37:38,835 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-14 01:37:38,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:38,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:38,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:37:38,835 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-14 01:37:38,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash -908647823, now seen corresponding path program 1 times [2025-04-14 01:37:38,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:38,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226947993] [2025-04-14 01:37:38,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:38,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:37:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:38,958 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-14 01:37:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:38,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226947993] [2025-04-14 01:37:38,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226947993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:38,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:38,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:37:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489283734] [2025-04-14 01:37:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:38,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:37:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:38,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:37:38,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:37:38,959 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:38,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 119 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-14 01:37:38,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:38,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:38,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:39,075 INFO L116 PetriNetUnfolderBase]: 95/187 cut-off events. [2025-04-14 01:37:39,076 INFO L117 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-04-14 01:37:39,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 187 events. 95/187 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 648 event pairs, 32 based on Foata normal form. 9/195 useless extension candidates. Maximal degree in co-relation 606. Up to 115 conditions per place. [2025-04-14 01:37:39,077 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 33 selfloop transitions, 4 changer transitions 9/46 dead transitions. [2025-04-14 01:37:39,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 318 flow [2025-04-14 01:37:39,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:37:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:37:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-14 01:37:39,079 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2025-04-14 01:37:39,079 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 119 flow. Second operand 5 states and 48 transitions. [2025-04-14 01:37:39,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 318 flow [2025-04-14 01:37:39,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 294 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:39,081 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 139 flow [2025-04-14 01:37:39,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=106, 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=5, PETRI_FLOW=139, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-04-14 01:37:39,081 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2025-04-14 01:37:39,081 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 139 flow [2025-04-14 01:37:39,081 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-14 01:37:39,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:39,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:39,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:37:39,083 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-14 01:37:39,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2031283422, now seen corresponding path program 3 times [2025-04-14 01:37:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:39,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628639871] [2025-04-14 01:37:39,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:39,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:39,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:39,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:39,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:39,224 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-14 01:37:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:39,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628639871] [2025-04-14 01:37:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628639871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:39,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007983258] [2025-04-14 01:37:39,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:39,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:39,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:39,227 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-14 01:37:39,228 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-14 01:37:39,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:39,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:39,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:39,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:39,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:39,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:39,312 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-14 01:37:39,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:39,374 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-14 01:37:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007983258] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:39,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-14 01:37:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935141248] [2025-04-14 01:37:39,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:39,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:37:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:37:39,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:37:39,376 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:39,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 139 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-14 01:37:39,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:39,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:39,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:39,490 INFO L116 PetriNetUnfolderBase]: 109/208 cut-off events. [2025-04-14 01:37:39,491 INFO L117 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-04-14 01:37:39,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 208 events. 109/208 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 703 event pairs, 38 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 756. Up to 128 conditions per place. [2025-04-14 01:37:39,492 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 31 selfloop transitions, 12 changer transitions 7/50 dead transitions. [2025-04-14 01:37:39,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 372 flow [2025-04-14 01:37:39,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:37:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:37:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-14 01:37:39,493 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2025-04-14 01:37:39,493 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 139 flow. Second operand 6 states and 55 transitions. [2025-04-14 01:37:39,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 372 flow [2025-04-14 01:37:39,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 344 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-04-14 01:37:39,496 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 203 flow [2025-04-14 01:37:39,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=126, 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=203, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2025-04-14 01:37:39,496 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2025-04-14 01:37:39,496 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 203 flow [2025-04-14 01:37:39,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-14 01:37:39,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:39,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:39,502 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-14 01:37:39,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:37:39,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-14 01:37:39,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -370505193, now seen corresponding path program 2 times [2025-04-14 01:37:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:39,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420864053] [2025-04-14 01:37:39,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:39,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:39,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:39,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:39,784 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-14 01:37:39,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:39,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420864053] [2025-04-14 01:37:39,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420864053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:39,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593439487] [2025-04-14 01:37:39,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:39,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:39,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:39,786 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-14 01:37:39,788 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-14 01:37:39,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:39,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:39,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:39,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:39,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:39,855 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-14 01:37:39,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:39,902 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-14 01:37:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593439487] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:39,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:39,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-14 01:37:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117020773] [2025-04-14 01:37:39,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:39,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:37:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:39,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:37:39,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:37:39,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:39,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 203 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-14 01:37:39,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:39,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:39,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:40,039 INFO L116 PetriNetUnfolderBase]: 122/225 cut-off events. [2025-04-14 01:37:40,039 INFO L117 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-04-14 01:37:40,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 225 events. 122/225 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 769 event pairs, 27 based on Foata normal form. 18/242 useless extension candidates. Maximal degree in co-relation 873. Up to 128 conditions per place. [2025-04-14 01:37:40,041 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 44 selfloop transitions, 13 changer transitions 2/59 dead transitions. [2025-04-14 01:37:40,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 475 flow [2025-04-14 01:37:40,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:37:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:37:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2025-04-14 01:37:40,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:37:40,044 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 203 flow. Second operand 6 states and 57 transitions. [2025-04-14 01:37:40,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 475 flow [2025-04-14 01:37:40,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 447 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-14 01:37:40,048 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 296 flow [2025-04-14 01:37:40,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-04-14 01:37:40,049 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2025-04-14 01:37:40,049 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 296 flow [2025-04-14 01:37:40,049 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-14 01:37:40,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:40,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:40,057 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-14 01:37:40,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:40,255 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-14 01:37:40,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1658625133, now seen corresponding path program 3 times [2025-04-14 01:37:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:40,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060448941] [2025-04-14 01:37:40,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:40,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:40,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:40,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:40,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:40,345 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-14 01:37:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:40,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060448941] [2025-04-14 01:37:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060448941] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:40,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11805326] [2025-04-14 01:37:40,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:40,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:40,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:40,348 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-14 01:37:40,349 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-14 01:37:40,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:40,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:40,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:40,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:40,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:40,423 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-14 01:37:40,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:40,487 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-14 01:37:40,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11805326] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:40,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:37:40,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-14 01:37:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617021671] [2025-04-14 01:37:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:40,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:37:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:40,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:37:40,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:37:40,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:40,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 296 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-14 01:37:40,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:40,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:40,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:40,564 INFO L116 PetriNetUnfolderBase]: 123/222 cut-off events. [2025-04-14 01:37:40,565 INFO L117 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-04-14 01:37:40,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 222 events. 123/222 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 705 event pairs, 24 based on Foata normal form. 4/225 useless extension candidates. Maximal degree in co-relation 991. Up to 166 conditions per place. [2025-04-14 01:37:40,566 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 35 selfloop transitions, 9 changer transitions 2/46 dead transitions. [2025-04-14 01:37:40,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 431 flow [2025-04-14 01:37:40,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:37:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:37:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-14 01:37:40,568 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:37:40,568 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 296 flow. Second operand 4 states and 38 transitions. [2025-04-14 01:37:40,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 431 flow [2025-04-14 01:37:40,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 412 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:40,571 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 322 flow [2025-04-14 01:37:40,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-14 01:37:40,571 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2025-04-14 01:37:40,571 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 322 flow [2025-04-14 01:37:40,571 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-14 01:37:40,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:40,572 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:40,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:37:40,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:40,772 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-14 01:37:40,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash -414709961, now seen corresponding path program 1 times [2025-04-14 01:37:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:40,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882824415] [2025-04-14 01:37:40,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:37:40,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:37:40,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:40,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882824415] [2025-04-14 01:37:40,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882824415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:40,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217433304] [2025-04-14 01:37:40,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:40,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:40,976 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-14 01:37:40,977 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-14 01:37:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:37:41,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:37:41,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:41,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:41,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 01:37:41,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:41,084 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 23 treesize of output 1 [2025-04-14 01:37:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:41,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:41,516 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 230 treesize of output 202 [2025-04-14 01:37:41,885 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:37:41,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 1719 treesize of output 1311 [2025-04-14 01:38:57,756 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:39:47,248 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:40:08,899 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:40:49,155 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:41:00,780 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:41:08,407 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-14 01:41:24,450 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-14 01:41:24,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-14 01:41:24,452 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 01:41:24,458 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-14 01:41:24,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:24,653 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:135) 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-14 01:41:24,660 INFO L158 Benchmark]: Toolchain (without parser) took 228385.30ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 100.1MB in the beginning and 674.5MB in the end (delta: -574.4MB). Peak memory consumption was 672.4MB. Max. memory is 8.0GB. [2025-04-14 01:41:24,660 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:41:24,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.84ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 85.0MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:41:24,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.80ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:41:24,661 INFO L158 Benchmark]: Boogie Preprocessor took 51.50ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 80.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:41:24,661 INFO L158 Benchmark]: IcfgBuilder took 602.08ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 29.2MB in the end (delta: 51.7MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-14 01:41:24,661 INFO L158 Benchmark]: TraceAbstraction took 227480.93ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 28.7MB in the beginning and 674.5MB in the end (delta: -645.8MB). Peak memory consumption was 601.1MB. Max. memory is 8.0GB. [2025-04-14 01:41:24,662 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 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.84ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 85.0MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.80ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.50ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 80.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 602.08ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 29.2MB in the end (delta: 51.7MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 227480.93ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 28.7MB in the beginning and 674.5MB in the end (delta: -645.8MB). Peak memory consumption was 601.1MB. 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...