./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2ee659e7bd0f15011c822a777a938a0e6f5b3a8f826a051cccefa88973daa0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:10:07,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:10:07,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:10:07,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:10:07,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:10:07,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:10:07,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:10:07,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:10:07,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:10:07,777 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:10:07,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:10:07,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:10:07,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:10:07,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:10:07,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:10:07,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:10:07,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:10:07,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:10:07,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:10:07,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:10:07,781 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b2ee659e7bd0f15011c822a777a938a0e6f5b3a8f826a051cccefa88973daa0 [2025-03-03 14:10:07,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:10:08,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:10:08,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:10:08,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:10:08,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:10:08,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c [2025-03-03 14:10:09,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afee000ec/019d0dd337ab4e3aa97bb18a62b9300a/FLAG375408e7c [2025-03-03 14:10:09,221 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:10:09,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c [2025-03-03 14:10:09,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afee000ec/019d0dd337ab4e3aa97bb18a62b9300a/FLAG375408e7c [2025-03-03 14:10:09,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afee000ec/019d0dd337ab4e3aa97bb18a62b9300a [2025-03-03 14:10:09,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:10:09,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:10:09,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:10:09,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:10:09,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:10:09,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c442bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09, skipping insertion in model container [2025-03-03 14:10:09,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:10:09,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c[458,471] [2025-03-03 14:10:09,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:10:09,736 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:10:09,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c[458,471] [2025-03-03 14:10:09,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:10:09,754 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:10:09,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09 WrapperNode [2025-03-03 14:10:09,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:10:09,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:10:09,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:10:09,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:10:09,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,771 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-03 14:10:09,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:10:09,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:10:09,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:10:09,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:10:09,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:10:09,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:10:09,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:10:09,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:10:09,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:10:09,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (1/1) ... [2025-03-03 14:10:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:10:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:10:09,823 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-03-03 14:10:09,831 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-03-03 14:10:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:10:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:10:09,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:10:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:10:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:10:09,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:10:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:10:09,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:10:09,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:10:09,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:10:09,969 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:10:09,969 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:10:09,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:10:09,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:10:09,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:10:09 BoogieIcfgContainer [2025-03-03 14:10:09,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:10:09,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:10:09,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:10:09,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:10:09,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:10:09" (1/3) ... [2025-03-03 14:10:09,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a7cbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:10:09, skipping insertion in model container [2025-03-03 14:10:09,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:10:09" (2/3) ... [2025-03-03 14:10:09,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a7cbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:10:09, skipping insertion in model container [2025-03-03 14:10:09,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:10:09" (3/3) ... [2025-03-03 14:10:09,981 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound20.c [2025-03-03 14:10:09,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:10:09,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_valuebound20.c that has 3 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:10:10,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:10:10,036 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@365ed750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:10:10,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:10:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:10:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 14:10:10,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:10:10,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:10:10,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:10:10,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:10:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 48082696, now seen corresponding path program 1 times [2025-03-03 14:10:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:10:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180416073] [2025-03-03 14:10:10,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:10:10,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 14:10:10,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 14:10:10,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:10,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:10:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:10:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:10:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180416073] [2025-03-03 14:10:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180416073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:10:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210995805] [2025-03-03 14:10:10,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:10,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:10:10,144 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-03-03 14:10:10,145 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-03-03 14:10:10,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 14:10:10,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 14:10:10,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:10:10,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:10:10,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:10:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:10:10,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:10:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210995805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:10:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:10:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 14:10:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024785979] [2025-03-03 14:10:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:10:10,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:10:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:10:10,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:10:10,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:10:10,232 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:10:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:10:10,245 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-03-03 14:10:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:10:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-03 14:10:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:10:10,249 INFO L225 Difference]: With dead ends: 43 [2025-03-03 14:10:10,250 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 14:10:10,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:10:10,253 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:10:10,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:10:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 14:10:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 14:10:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:10:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-03 14:10:10,274 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2025-03-03 14:10:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:10:10,274 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-03 14:10:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:10:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-03 14:10:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 14:10:10,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:10:10,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:10:10,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:10:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:10:10,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:10:10,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:10:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1497490024, now seen corresponding path program 1 times [2025-03-03 14:10:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:10:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192607363] [2025-03-03 14:10:10,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:10:10,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 14:10:10,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 14:10:10,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:10,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:10:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541551640] [2025-03-03 14:10:10,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:10:10,494 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-03-03 14:10:10,495 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-03-03 14:10:10,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 14:10:10,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 14:10:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:10:10,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:10:10,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:10:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:10:10,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:10:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:10:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192607363] [2025-03-03 14:10:10,590 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:10:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541551640] [2025-03-03 14:10:10,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541551640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:10:10,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:10:10,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:10:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051506792] [2025-03-03 14:10:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:10:10,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:10:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:10:10,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:10:10,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:10:10,591 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:10:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:10:10,639 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-03 14:10:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:10:10,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-03-03 14:10:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:10:10,640 INFO L225 Difference]: With dead ends: 29 [2025-03-03 14:10:10,641 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 14:10:10,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:10:10,642 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:10:10,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:10:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 14:10:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 14:10:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:10:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-03 14:10:10,648 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2025-03-03 14:10:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:10:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-03 14:10:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:10:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-03 14:10:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:10:10,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:10:10,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:10:10,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:10:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:10:10,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:10:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:10:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash -722676116, now seen corresponding path program 1 times [2025-03-03 14:10:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:10:10,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767364295] [2025-03-03 14:10:10,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:10:10,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:10:10,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:10:10,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:10,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:10:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784140372] [2025-03-03 14:10:10,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:10:10,873 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-03-03 14:10:10,874 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-03-03 14:10:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:10:10,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:10:10,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:10,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:10:10,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:10:10,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:10:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:10:10,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:10:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:10:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:10:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767364295] [2025-03-03 14:10:11,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:10:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784140372] [2025-03-03 14:10:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784140372] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:10:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:10:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 14:10:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639723859] [2025-03-03 14:10:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:10:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:10:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:10:11,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:10:11,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:10:11,044 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:10:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:10:11,082 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-03-03 14:10:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:10:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-03 14:10:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:10:11,083 INFO L225 Difference]: With dead ends: 31 [2025-03-03 14:10:11,083 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 14:10:11,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:10:11,085 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:10:11,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:10:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 14:10:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 14:10:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:10:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-03 14:10:11,091 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2025-03-03 14:10:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:10:11,091 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-03 14:10:11,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:10:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-03 14:10:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:10:11,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:10:11,092 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:10:11,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:10:11,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:11,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:10:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:10:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1455469544, now seen corresponding path program 1 times [2025-03-03 14:10:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:10:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476296144] [2025-03-03 14:10:11,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:10:11,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:10:11,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:10:11,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:11,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:10:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093677716] [2025-03-03 14:10:11,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:10:11,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:11,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:10:11,321 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-03-03 14:10:11,322 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-03-03 14:10:11,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:10:11,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:10:11,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:10:11,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:10:11,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:10:11,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:10:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:10:11,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:10:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:10:11,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:10:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476296144] [2025-03-03 14:10:11,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:10:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093677716] [2025-03-03 14:10:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093677716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:10:11,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:10:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-03 14:10:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846638162] [2025-03-03 14:10:11,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:10:11,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:10:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:10:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:10:11,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:10:11,518 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-03 14:10:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:10:11,617 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-03 14:10:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:10:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2025-03-03 14:10:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:10:11,618 INFO L225 Difference]: With dead ends: 41 [2025-03-03 14:10:11,618 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 14:10:11,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:10:11,619 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:10:11,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:10:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 14:10:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 14:10:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:10:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-03 14:10:11,630 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 34 [2025-03-03 14:10:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:10:11,630 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-03 14:10:11,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-03 14:10:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-03 14:10:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:10:11,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:10:11,631 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:10:11,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:10:11,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:11,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:10:11,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:10:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash -431437220, now seen corresponding path program 2 times [2025-03-03 14:10:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:10:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913116326] [2025-03-03 14:10:11,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:10:11,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:10:11,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-03 14:10:11,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:10:11,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:10:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:10:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541807516] [2025-03-03 14:10:11,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:10:11,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:11,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:10:11,880 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-03-03 14:10:11,881 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-03-03 14:10:11,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-03 14:10:11,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:10:11,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:10:11,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:10:11,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 14:10:11,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:10:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:10:12,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:10:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:10:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:10:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913116326] [2025-03-03 14:10:12,333 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:10:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541807516] [2025-03-03 14:10:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541807516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:10:12,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:10:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-03-03 14:10:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514669524] [2025-03-03 14:10:12,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:10:12,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:10:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:10:12,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:10:12,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:10:12,334 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-03 14:10:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:10:12,534 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-03-03 14:10:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:10:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 52 [2025-03-03 14:10:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:10:12,535 INFO L225 Difference]: With dead ends: 37 [2025-03-03 14:10:12,535 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:10:12,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:10:12,537 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:10:12,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:10:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:10:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:10:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03-03 14:10:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:10:12,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-03-03 14:10:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:10:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:10:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-03 14:10:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:10:12,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:10:12,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:10:12,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:10:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:10:12,743 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-03-03 14:10:12,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:10:12,869 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:10:12,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:10:12 BoogieIcfgContainer [2025-03-03 14:10:12,880 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:10:12,881 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:10:12,881 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:10:12,881 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:10:12,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:10:09" (3/4) ... [2025-03-03 14:10:12,883 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:10:12,886 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 14:10:12,886 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-03 14:10:12,888 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 14:10:12,888 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 14:10:12,888 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:10:12,888 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:10:12,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:10:12,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:10:12,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:10:12,938 INFO L158 Benchmark]: Toolchain (without parser) took 3332.21ms. Allocated memory is still 201.3MB. Free memory was 160.4MB in the beginning and 158.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:10:12,939 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:10:12,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.08ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 149.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:10:12,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.00ms. Allocated memory is still 201.3MB. Free memory was 149.1MB in the beginning and 147.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:10:12,940 INFO L158 Benchmark]: Boogie Preprocessor took 22.06ms. Allocated memory is still 201.3MB. Free memory was 147.9MB in the beginning and 146.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:10:12,940 INFO L158 Benchmark]: IcfgBuilder took 180.51ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 134.9MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:10:12,941 INFO L158 Benchmark]: TraceAbstraction took 2903.91ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 164.8MB in the end (delta: -30.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-03-03 14:10:12,941 INFO L158 Benchmark]: Witness Printer took 57.17ms. Allocated memory is still 201.3MB. Free memory was 164.8MB in the beginning and 158.7MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:10:12,942 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.08ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 149.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.00ms. Allocated memory is still 201.3MB. Free memory was 149.1MB in the beginning and 147.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.06ms. Allocated memory is still 201.3MB. Free memory was 147.9MB in the beginning and 146.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 180.51ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 134.9MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2903.91ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 164.8MB in the end (delta: -30.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 57.17ms. Allocated memory is still 201.3MB. Free memory was 164.8MB in the beginning and 158.7MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 100 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 777 SizeOfPredicates, 7 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 187/266 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((y + ((__int128) y * y)) == (c + ((__int128) c * y))) && ((((__int128) 2 * c) + ((__int128) c * y)) == (((__int128) 2 * y) + ((__int128) y * y)))) && ((((6 * (((((__int128) y * y) * y) * y) * y)) + (2 * ((((((__int128) y * y) * y) * y) * y) * y))) + (5 * ((((__int128) y * y) * y) * y))) == (((__int128) x * 12) + ((__int128) y * y)))) && ((((__int128) k * y) == ((__int128) y * y)) || (c < k))) RESULT: Ultimate proved your program to be correct! [2025-03-03 14:10:12,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE