./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_o20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/recursive-simple/id_o20.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 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:45:54,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:45:54,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:45:54,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:45:54,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:45:54,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:45:54,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:45:54,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:45:54,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:45:54,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:45:54,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:45:54,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:45:54,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:45:54,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:45:54,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:45:54,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:45:54,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:45:54,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:45:54,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:45:54,989 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 -> 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d [2025-03-08 05:45:55,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:45:55,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:45:55,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:45:55,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:45:55,211 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:45:55,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_o20.c [2025-03-08 05:45:56,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748bf34df/58e464b0dfe347d09a2e36c8a493f2d5/FLAGed6eb4d15 [2025-03-08 05:45:56,584 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:45:56,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c [2025-03-08 05:45:56,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748bf34df/58e464b0dfe347d09a2e36c8a493f2d5/FLAGed6eb4d15 [2025-03-08 05:45:56,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748bf34df/58e464b0dfe347d09a2e36c8a493f2d5 [2025-03-08 05:45:56,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:45:56,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:45:56,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:45:56,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:45:56,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:45:56,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c66f3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56, skipping insertion in model container [2025-03-08 05:45:56,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:45:56,728 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/recursive-simple/id_o20.c[516,529] [2025-03-08 05:45:56,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:45:56,739 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:45:56,747 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/recursive-simple/id_o20.c[516,529] [2025-03-08 05:45:56,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:45:56,759 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:45:56,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56 WrapperNode [2025-03-08 05:45:56,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:45:56,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:45:56,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:45:56,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:45:56,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,781 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-03-08 05:45:56,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:45:56,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:45:56,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:45:56,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:45:56,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,798 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-08 05:45:56,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:45:56,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:45:56,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:45:56,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:45:56,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (1/1) ... [2025-03-08 05:45:56,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:45:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:56,842 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-08 05:45:56,848 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-08 05:45:56,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:45:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:45:56,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:45:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:45:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-08 05:45:56,871 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-08 05:45:56,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:45:56,924 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:45:56,987 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-08 05:45:56,997 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-08 05:45:56,997 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:45:57,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:45:57,009 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:45:57,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:45:57 BoogieIcfgContainer [2025-03-08 05:45:57,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:45:57,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:45:57,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:45:57,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:45:57,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:45:56" (1/3) ... [2025-03-08 05:45:57,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df21fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:45:57, skipping insertion in model container [2025-03-08 05:45:57,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:56" (2/3) ... [2025-03-08 05:45:57,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df21fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:45:57, skipping insertion in model container [2025-03-08 05:45:57,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:45:57" (3/3) ... [2025-03-08 05:45:57,020 INFO L128 eAbstractionObserver]: Analyzing ICFG id_o20.c [2025-03-08 05:45:57,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:45:57,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_o20.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:45:57,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:45:57,093 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;@54bff629, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:45:57,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:45:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:45:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:45:57,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:57,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:57,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:57,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1536782931, now seen corresponding path program 1 times [2025-03-08 05:45:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155689190] [2025-03-08 05:45:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:57,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:45:57,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:45:57,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:57,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:45:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155689190] [2025-03-08 05:45:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155689190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:45:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:45:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:45:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666194630] [2025-03-08 05:45:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:45:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:45:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:57,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:45:57,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:45:57,338 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:45:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:57,376 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-08 05:45:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:45:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-08 05:45:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:57,382 INFO L225 Difference]: With dead ends: 25 [2025-03-08 05:45:57,383 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 05:45:57,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:45:57,388 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:57,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:45:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 05:45:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 05:45:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:45:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-08 05:45:57,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2025-03-08 05:45:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-08 05:45:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:45:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-08 05:45:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 05:45:57,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:57,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:57,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:45:57,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash -808024836, now seen corresponding path program 1 times [2025-03-08 05:45:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979766285] [2025-03-08 05:45:57,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:57,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 05:45:57,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 05:45:57,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:57,610 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-08 05:45:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979766285] [2025-03-08 05:45:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979766285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463001224] [2025-03-08 05:45:57,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:57,613 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-08 05:45:57,614 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-08 05:45:57,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 05:45:57,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 05:45:57,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:57,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:57,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:57,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:57,694 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-08 05:45:57,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:57,804 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-08 05:45:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463001224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:57,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:57,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 05:45:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647035874] [2025-03-08 05:45:57,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:45:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:57,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:45:57,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:45:57,809 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:45:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:57,844 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-03-08 05:45:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:45:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 16 [2025-03-08 05:45:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:57,846 INFO L225 Difference]: With dead ends: 27 [2025-03-08 05:45:57,846 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 05:45:57,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:45:57,848 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:57,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:45:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 05:45:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 05:45:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:45:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-08 05:45:57,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2025-03-08 05:45:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:57,853 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-08 05:45:57,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:45:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-08 05:45:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:45:57,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:57,853 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:57,860 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-08 05:45:58,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:58,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:58,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1224835100, now seen corresponding path program 2 times [2025-03-08 05:45:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:58,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417020675] [2025-03-08 05:45:58,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:58,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:58,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 05:45:58,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:45:58,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:58,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:45:58,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417020675] [2025-03-08 05:45:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417020675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305751463] [2025-03-08 05:45:58,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:58,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:58,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:58,265 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-08 05:45:58,266 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-08 05:45:58,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 05:45:58,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:45:58,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:58,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 05:45:58,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:45:58,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:45:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305751463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:58,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-08 05:45:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711213522] [2025-03-08 05:45:58,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:45:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:45:58,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:45:58,552 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 05:45:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:58,700 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-08 05:45:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:45:58,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 28 [2025-03-08 05:45:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:58,701 INFO L225 Difference]: With dead ends: 39 [2025-03-08 05:45:58,701 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 05:45:58,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:45:58,702 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:58,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 05:45:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 05:45:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:45:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-08 05:45:58,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2025-03-08 05:45:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:58,707 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-08 05:45:58,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 05:45:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-08 05:45:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:45:58,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:58,708 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:58,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:45:58,908 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,SelfDestructingSolverStorable2 [2025-03-08 05:45:58,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 854543964, now seen corresponding path program 3 times [2025-03-08 05:45:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655375452] [2025-03-08 05:45:58,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:58,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 8 equivalence classes. [2025-03-08 05:45:58,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:45:58,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 05:45:58,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 05:45:59,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655375452] [2025-03-08 05:45:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655375452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820750923] [2025-03-08 05:45:59,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:59,320 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-08 05:45:59,322 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-08 05:45:59,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 8 equivalence classes. [2025-03-08 05:45:59,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:45:59,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 05:45:59,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:59,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 05:45:59,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 05:45:59,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:46:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 05:46:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820750923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:46:00,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:46:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2025-03-08 05:46:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824070252] [2025-03-08 05:46:00,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:46:00,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 05:46:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:46:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 05:46:00,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 05:46:00,167 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 05:46:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:46:00,864 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-03-08 05:46:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 05:46:00,865 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 52 [2025-03-08 05:46:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:46:00,866 INFO L225 Difference]: With dead ends: 63 [2025-03-08 05:46:00,867 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 05:46:00,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 05:46:00,869 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:46:00,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:46:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 05:46:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 05:46:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:46:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2025-03-08 05:46:00,880 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2025-03-08 05:46:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:46:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2025-03-08 05:46:00,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 05:46:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2025-03-08 05:46:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:46:00,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:46:00,885 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:46:00,891 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-08 05:46:01,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:46:01,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:46:01,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:46:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1090669276, now seen corresponding path program 4 times [2025-03-08 05:46:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:46:01,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195647299] [2025-03-08 05:46:01,086 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:46:01,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:46:01,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-08 05:46:01,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:46:01,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:46:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:46:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-08 05:46:01,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:46:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195647299] [2025-03-08 05:46:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195647299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:46:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785322321] [2025-03-08 05:46:01,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:46:01,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:46:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:46:01,868 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-08 05:46:01,869 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-08 05:46:01,897 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-08 05:46:01,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:46:01,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:46:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:46:01,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 05:46:01,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:46:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-08 05:46:02,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:46:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-08 05:46:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785322321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:46:03,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:46:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2025-03-08 05:46:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038911691] [2025-03-08 05:46:03,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:46:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-08 05:46:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:46:03,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-08 05:46:03,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2025-03-08 05:46:03,949 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 05:46:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:46:22,148 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2025-03-08 05:46:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-08 05:46:22,148 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 100 [2025-03-08 05:46:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:46:22,149 INFO L225 Difference]: With dead ends: 111 [2025-03-08 05:46:22,149 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 05:46:22,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1291, Invalid=8021, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 05:46:22,151 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:46:22,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1397 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:46:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 05:46:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 05:46:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (34), 32 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 05:46:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2025-03-08 05:46:22,163 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2025-03-08 05:46:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:46:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2025-03-08 05:46:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 05:46:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2025-03-08 05:46:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:46:22,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:46:22,165 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:46:22,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:46:22,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:46:22,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:46:22,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:46:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1285139181, now seen corresponding path program 5 times [2025-03-08 05:46:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:46:22,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813171095] [2025-03-08 05:46:22,370 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:46:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:46:22,379 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 130 statements into 21 equivalence classes. [2025-03-08 05:46:22,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:46:22,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-08 05:46:22,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:46:22,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:46:22,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:46:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:46:22,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:46:22,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:46:22,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:46:22,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:46:22,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:46:22,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:46:22,625 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1] [2025-03-08 05:46:22,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:46:22,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:46:22 BoogieIcfgContainer [2025-03-08 05:46:22,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:46:22,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:46:22,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:46:22,663 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:46:22,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:45:57" (3/4) ... [2025-03-08 05:46:22,664 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:46:22,711 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 65. [2025-03-08 05:46:22,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:46:22,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:46:22,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:46:22,772 INFO L158 Benchmark]: Toolchain (without parser) took 26169.75ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.0MB in the beginning and 109.4MB in the end (delta: 2.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-03-08 05:46:22,772 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:46:22,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.74ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:46:22,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.14ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.3MB in the end (delta: 977.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:46:22,773 INFO L158 Benchmark]: Boogie Preprocessor took 24.34ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 995.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:46:22,773 INFO L158 Benchmark]: IcfgBuilder took 202.50ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 89.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:46:22,773 INFO L158 Benchmark]: TraceAbstraction took 25651.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.0MB in the beginning and 117.7MB in the end (delta: -28.8MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2025-03-08 05:46:22,773 INFO L158 Benchmark]: Witness Printer took 108.67ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 109.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:46:22,774 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.50ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.74ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.14ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.3MB in the end (delta: 977.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.34ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 995.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 202.50ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 89.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25651.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.0MB in the beginning and 117.7MB in the end (delta: -28.8MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Witness Printer took 108.67ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 109.4MB in the end (delta: 8.4MB). 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] unsigned int input = __VERIFIER_nondet_uint(); [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=20] [L13] unsigned int result = id(input); [L14] COND TRUE result == 20 VAL [input=20] [L15] reach_error() VAL [input=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 20 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.6s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 2222 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2101 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 996 IncrementalHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 121 mSDtfsCounter, 996 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 137, 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.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 1619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 1317/2634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:46:22,789 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE