/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/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:26:51,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:26:51,856 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 00:26:51,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:26:51,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:26:51,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:26:51,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:26:51,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:26:51,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:26:51,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:26:51,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:26:51,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:26:51,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:26:51,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:26:51,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:26:51,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:26:51,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:26:51,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:26:51,886 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 00:26:52,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:26:52,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:26:52,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:26:52,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:26:52,125 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:26:52,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2025-04-14 00:26:53,383 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52904bcca/8807a67591e04822a58d11ae5e44b6fe/FLAG97156ae90 [2025-04-14 00:26:53,571 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:26:53,572 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2025-04-14 00:26:53,576 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52904bcca/8807a67591e04822a58d11ae5e44b6fe/FLAG97156ae90 [2025-04-14 00:26:54,435 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52904bcca/8807a67591e04822a58d11ae5e44b6fe [2025-04-14 00:26:54,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:26:54,439 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:26:54,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:26:54,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:26:54,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:26:54,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e658f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54, skipping insertion in model container [2025-04-14 00:26:54,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:26:54,621 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/chl-array-int-subst.wvr.c[2820,2833] [2025-04-14 00:26:54,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:26:54,647 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:26:54,672 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/chl-array-int-subst.wvr.c[2820,2833] [2025-04-14 00:26:54,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:26:54,684 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:26:54,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54 WrapperNode [2025-04-14 00:26:54,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:26:54,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:26:54,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:26:54,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:26:54,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,713 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-04-14 00:26:54,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:26:54,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:26:54,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:26:54,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:26:54,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,733 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 00:26:54,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:26:54,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:26:54,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:26:54,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:26:54,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (1/1) ... [2025-04-14 00:26:54,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:26:54,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:54,770 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 00:26:54,772 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 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:26:54,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:26:54,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:26:54,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:26:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:26:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:26:54,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:26:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:26:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:26:54,788 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 00:26:54,866 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:26:54,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:26:55,191 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:26:55,191 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:26:55,191 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:26:55,465 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:26:55,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:26:55 BoogieIcfgContainer [2025-04-14 00:26:55,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:26:55,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:26:55,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:26:55,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:26:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:26:54" (1/3) ... [2025-04-14 00:26:55,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c342c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:26:55, skipping insertion in model container [2025-04-14 00:26:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:26:54" (2/3) ... [2025-04-14 00:26:55,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c342c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:26:55, skipping insertion in model container [2025-04-14 00:26:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:26:55" (3/3) ... [2025-04-14 00:26:55,483 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-04-14 00:26:55,494 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:26:55,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:26:55,496 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:26:55,537 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:26:55,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 00:26:55,586 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-14 00:26:55,588 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:26:55,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-14 00:26:55,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 00:26:55,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-14 00:26:55,601 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:26:55,612 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;@1cb088dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:26:55,612 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:26:55,624 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:26:55,624 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-14 00:26:55,624 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:26:55,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:55,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:55,625 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:26:55,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -839651744, now seen corresponding path program 1 times [2025-04-14 00:26:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:55,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896267959] [2025-04-14 00:26:55,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:55,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:26:55,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:26:55,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:55,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:56,833 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 00:26:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:56,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896267959] [2025-04-14 00:26:56,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896267959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:56,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:56,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:26:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226766266] [2025-04-14 00:26:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:56,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:26:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:56,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:26:56,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:26:56,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:26:56,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 00:26:56,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:56,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:26:56,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:57,422 INFO L116 PetriNetUnfolderBase]: 422/645 cut-off events. [2025-04-14 00:26:57,422 INFO L117 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-04-14 00:26:57,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 645 events. 422/645 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2135 event pairs, 36 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 618. Up to 257 conditions per place. [2025-04-14 00:26:57,427 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 63 selfloop transitions, 11 changer transitions 11/85 dead transitions. [2025-04-14 00:26:57,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 403 flow [2025-04-14 00:26:57,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:26:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:26:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-14 00:26:57,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2025-04-14 00:26:57,440 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 10 states and 119 transitions. [2025-04-14 00:26:57,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 403 flow [2025-04-14 00:26:57,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 85 transitions, 361 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:26:57,448 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 134 flow [2025-04-14 00:26:57,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=134, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-04-14 00:26:57,452 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-04-14 00:26:57,452 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 134 flow [2025-04-14 00:26:57,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 00:26:57,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:57,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:57,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:26:57,453 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:26:57,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1444905204, now seen corresponding path program 2 times [2025-04-14 00:26:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:57,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758562499] [2025-04-14 00:26:57,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:26:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:57,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:26:57,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:26:57,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:26:57,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:58,054 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 00:26:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:58,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758562499] [2025-04-14 00:26:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758562499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:26:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:26:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:26:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229337304] [2025-04-14 00:26:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:58,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:26:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:58,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:26:58,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:26:58,056 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:26:58,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 00:26:58,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:58,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:26:58,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:58,435 INFO L116 PetriNetUnfolderBase]: 320/497 cut-off events. [2025-04-14 00:26:58,435 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-14 00:26:58,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 497 events. 320/497 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1553 event pairs, 36 based on Foata normal form. 28/473 useless extension candidates. Maximal degree in co-relation 1016. Up to 257 conditions per place. [2025-04-14 00:26:58,440 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 32 selfloop transitions, 8 changer transitions 31/71 dead transitions. [2025-04-14 00:26:58,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 358 flow [2025-04-14 00:26:58,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:26:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:26:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2025-04-14 00:26:58,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2025-04-14 00:26:58,443 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 134 flow. Second operand 9 states and 101 transitions. [2025-04-14 00:26:58,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 358 flow [2025-04-14 00:26:58,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 350 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-14 00:26:58,445 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 134 flow [2025-04-14 00:26:58,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-04-14 00:26:58,445 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-04-14 00:26:58,445 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 134 flow [2025-04-14 00:26:58,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 00:26:58,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:58,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:58,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:26:58,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:26:58,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:58,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1414476485, now seen corresponding path program 1 times [2025-04-14 00:26:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:58,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389450427] [2025-04-14 00:26:58,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:58,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:26:58,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:26:58,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:58,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389450427] [2025-04-14 00:26:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389450427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:58,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072902477] [2025-04-14 00:26:58,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:58,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:58,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:58,666 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 00:26:58,667 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 00:26:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:26:58,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:26:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:58,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:26:58,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:26:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:58,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:58,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072902477] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:58,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:26:58,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 15 [2025-04-14 00:26:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362245072] [2025-04-14 00:26:58,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:26:58,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:26:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:58,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:26:58,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:26:58,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:26:58,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 134 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 00:26:58,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:58,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:26:58,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:59,229 INFO L116 PetriNetUnfolderBase]: 543/802 cut-off events. [2025-04-14 00:26:59,230 INFO L117 PetriNetUnfolderBase]: For 723/723 co-relation queries the response was YES. [2025-04-14 00:26:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 802 events. 543/802 cut-off events. For 723/723 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2622 event pairs, 220 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 1950. Up to 300 conditions per place. [2025-04-14 00:26:59,233 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 67 selfloop transitions, 5 changer transitions 17/89 dead transitions. [2025-04-14 00:26:59,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 513 flow [2025-04-14 00:26:59,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:26:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:26:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-14 00:26:59,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2025-04-14 00:26:59,234 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 134 flow. Second operand 6 states and 97 transitions. [2025-04-14 00:26:59,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 513 flow [2025-04-14 00:26:59,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 89 transitions, 457 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-04-14 00:26:59,237 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 137 flow [2025-04-14 00:26:59,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-04-14 00:26:59,238 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2025-04-14 00:26:59,238 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 137 flow [2025-04-14 00:26:59,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 00:26:59,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:59,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:59,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:26:59,443 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 00:26:59,443 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:26:59,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:59,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1775894271, now seen corresponding path program 1 times [2025-04-14 00:26:59,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:59,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433189934] [2025-04-14 00:26:59,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:59,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:59,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:26:59,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:26:59,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:59,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:59,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433189934] [2025-04-14 00:26:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433189934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:59,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142305934] [2025-04-14 00:26:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:59,917 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 00:26:59,919 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 00:26:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:26:59,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:26:59,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:59,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:59,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:26:59,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:01,605 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:27:01,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 458 treesize of output 982 [2025-04-14 00:28:54,217 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 00:28:54,217 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 00:28:54,218 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 00:28:54,224 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 00:28:54,419 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,SelfDestructingSolverStorable3 [2025-04-14 00:28:54,419 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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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) ... 77 more [2025-04-14 00:28:54,424 INFO L158 Benchmark]: Toolchain (without parser) took 119985.71ms. Allocated memory was 125.8MB in the beginning and 746.6MB in the end (delta: 620.8MB). Free memory was 91.8MB in the beginning and 344.0MB in the end (delta: -252.2MB). Peak memory consumption was 462.2MB. Max. memory is 8.0GB. [2025-04-14 00:28:54,425 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:28:54,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.74ms. Allocated memory is still 125.8MB. Free memory was 91.8MB in the beginning and 76.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:28:54,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.45ms. Allocated memory is still 125.8MB. Free memory was 76.0MB in the beginning and 73.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:28:54,425 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 125.8MB. Free memory was 73.3MB in the beginning and 71.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:28:54,425 INFO L158 Benchmark]: IcfgBuilder took 716.50ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 31.0MB in the end (delta: 40.0MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. [2025-04-14 00:28:54,425 INFO L158 Benchmark]: TraceAbstraction took 118957.18ms. Allocated memory was 125.8MB in the beginning and 746.6MB in the end (delta: 620.8MB). Free memory was 30.4MB in the beginning and 344.0MB in the end (delta: -313.6MB). Peak memory consumption was 400.8MB. Max. memory is 8.0GB. [2025-04-14 00:28:54,428 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 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.74ms. Allocated memory is still 125.8MB. Free memory was 91.8MB in the beginning and 76.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.45ms. Allocated memory is still 125.8MB. Free memory was 76.0MB in the beginning and 73.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 125.8MB. Free memory was 73.3MB in the beginning and 71.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 716.50ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 31.0MB in the end (delta: 40.0MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. * TraceAbstraction took 118957.18ms. Allocated memory was 125.8MB in the beginning and 746.6MB in the end (delta: 620.8MB). Free memory was 30.4MB in the beginning and 344.0MB in the end (delta: -313.6MB). Peak memory consumption was 400.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...