./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.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/recursive/Fibonacci05.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 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:32:24,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:32:24,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:32:24,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:32:24,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:32:24,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:32:24,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:32:24,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:32:24,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:32:24,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:32:24,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:32:24,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:32:24,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:32:24,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:32:24,196 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:32:24,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:32:24,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:32:24,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:32:24,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:24,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:32:24,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:32:24,200 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 -> 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 [2025-03-03 14:32:24,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:32:24,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:32:24,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:32:24,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:32:24,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:32:24,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2025-03-03 14:32:25,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c0acf78/6cf8eaba56ce4cd7984bb3ff674ae9d8/FLAGcbcf4d35f [2025-03-03 14:32:25,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:32:25,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2025-03-03 14:32:25,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c0acf78/6cf8eaba56ce4cd7984bb3ff674ae9d8/FLAGcbcf4d35f [2025-03-03 14:32:26,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c0acf78/6cf8eaba56ce4cd7984bb3ff674ae9d8 [2025-03-03 14:32:26,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:32:26,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:32:26,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:26,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:32:26,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:32:26,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fe8ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26, skipping insertion in model container [2025-03-03 14:32:26,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:32:26,357 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/Fibonacci05.c[788,801] [2025-03-03 14:32:26,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:26,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:32:26,374 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/Fibonacci05.c[788,801] [2025-03-03 14:32:26,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:26,384 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:32:26,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26 WrapperNode [2025-03-03 14:32:26,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:26,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:26,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:32:26,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:32:26,392 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:32:26" (1/1) ... [2025-03-03 14:32:26,399 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:32:26" (1/1) ... [2025-03-03 14:32:26,413 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-03 14:32:26,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:26,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:32:26,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:32:26,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:32:26,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,430 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:32:26,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:32:26,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:32:26,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:32:26,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:32:26,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (1/1) ... [2025-03-03 14:32:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:26,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:26,472 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:32:26,478 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:32:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-03 14:32:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-03 14:32:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:32:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:32:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:32:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:32:26,530 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:32:26,532 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:32:26,571 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-03 14:32:26,607 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 14:32:26,607 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:32:26,615 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:32:26,615 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:32:26,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:26 BoogieIcfgContainer [2025-03-03 14:32:26,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:32:26,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:32:26,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:32:26,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:32:26,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:32:26" (1/3) ... [2025-03-03 14:32:26,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651f2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:26, skipping insertion in model container [2025-03-03 14:32:26,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:26" (2/3) ... [2025-03-03 14:32:26,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651f2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:26, skipping insertion in model container [2025-03-03 14:32:26,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:26" (3/3) ... [2025-03-03 14:32:26,624 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2025-03-03 14:32:26,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:32:26,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci05.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:32:26,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:32:26,681 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;@6490f9bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:32:26,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:32:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:32:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:32:26,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:26,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:26,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 828343037, now seen corresponding path program 1 times [2025-03-03 14:32:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58144184] [2025-03-03 14:32:26,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:26,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:32:26,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:32:26,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:26,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:26,893 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-03 14:32:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58144184] [2025-03-03 14:32:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58144184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:26,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:32:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732763420] [2025-03-03 14:32:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:26,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:32:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:26,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:32:26,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:32:26,915 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-03 14:32:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:26,991 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-03 14:32:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:32:26,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-03-03 14:32:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:26,998 INFO L225 Difference]: With dead ends: 31 [2025-03-03 14:32:26,998 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:32:27,000 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-03 14:32:27,002 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:27,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:32:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-03 14:32:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:32:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 14:32:27,027 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-03-03 14:32:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:27,028 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 14:32:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-03 14:32:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 14:32:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 14:32:27,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:27,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:32:27,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1856819262, now seen corresponding path program 1 times [2025-03-03 14:32:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569104581] [2025-03-03 14:32:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:27,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 14:32:27,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 14:32:27,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:27,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:27,092 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-03 14:32:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569104581] [2025-03-03 14:32:27,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569104581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:27,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:27,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:32:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959087694] [2025-03-03 14:32:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:27,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:32:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:27,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:32:27,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:32:27,095 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-03 14:32:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:27,143 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-03 14:32:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:32:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-03-03 14:32:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:27,144 INFO L225 Difference]: With dead ends: 25 [2025-03-03 14:32:27,144 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:32:27,144 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-03 14:32:27,145 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:27,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:32:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:32:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-03 14:32:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:32:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 14:32:27,152 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-03-03 14:32:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:27,152 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 14:32:27,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-03 14:32:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 14:32:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:32:27,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:27,153 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:27,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:32:27,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:27,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash 87542200, now seen corresponding path program 1 times [2025-03-03 14:32:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053471662] [2025-03-03 14:32:27,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:27,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:32:27,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:32:27,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:27,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:32:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053471662] [2025-03-03 14:32:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053471662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:27,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133536062] [2025-03-03 14:32:27,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:27,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:27,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:27,289 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:32:27,290 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:32:27,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:32:27,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:32:27,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:27,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:27,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:32:27,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:32:27,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:32:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133536062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:27,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:27,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2025-03-03 14:32:27,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715106775] [2025-03-03 14:32:27,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:27,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:32:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:27,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:32:27,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:32:27,616 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-03 14:32:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:27,739 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-03-03 14:32:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:32:27,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2025-03-03 14:32:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:27,740 INFO L225 Difference]: With dead ends: 43 [2025-03-03 14:32:27,740 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 14:32:27,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:32:27,741 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:27,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 14:32:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 14:32:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:32:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-03 14:32:27,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 24 [2025-03-03 14:32:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:27,747 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-03 14:32:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-03 14:32:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-03 14:32:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:32:27,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:27,749 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:27,761 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:32:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:27,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1457957336, now seen corresponding path program 1 times [2025-03-03 14:32:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324088489] [2025-03-03 14:32:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:27,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 14:32:27,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:32:27,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:32:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324088489] [2025-03-03 14:32:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324088489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449354202] [2025-03-03 14:32:28,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:28,100 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:32:28,102 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:32:28,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 14:32:28,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:32:28,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:28,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:32:28,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:32:28,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 14:32:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449354202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:28,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2025-03-03 14:32:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234550004] [2025-03-03 14:32:28,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:28,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:32:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:28,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:32:28,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:32:28,485 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-03 14:32:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:28,594 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2025-03-03 14:32:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:32:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 52 [2025-03-03 14:32:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:28,596 INFO L225 Difference]: With dead ends: 45 [2025-03-03 14:32:28,596 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 14:32:28,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:32:28,597 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:28,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 69 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 14:32:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-03 14:32:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-03 14:32:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2025-03-03 14:32:28,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 52 [2025-03-03 14:32:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2025-03-03 14:32:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-03 14:32:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2025-03-03 14:32:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:32:28,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:28,612 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 15, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:28,617 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:32:28,812 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,SelfDestructingSolverStorable3 [2025-03-03 14:32:28,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:28,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1769127806, now seen corresponding path program 2 times [2025-03-03 14:32:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667144019] [2025-03-03 14:32:28,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:28,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-03 14:32:28,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:32:28,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:28,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-03-03 14:32:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667144019] [2025-03-03 14:32:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667144019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125399790] [2025-03-03 14:32:29,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:29,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:29,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:29,077 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:32:29,080 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:32:29,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-03 14:32:29,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:32:29,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:29,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:29,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:32:29,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-03-03 14:32:29,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 427 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-03-03 14:32:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125399790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:30,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2025-03-03 14:32:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892910763] [2025-03-03 14:32:30,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:30,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:32:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:30,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:32:30,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:32:30,092 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-03 14:32:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:30,232 INFO L93 Difference]: Finished difference Result 55 states and 111 transitions. [2025-03-03 14:32:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:32:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) Word has length 158 [2025-03-03 14:32:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:30,235 INFO L225 Difference]: With dead ends: 55 [2025-03-03 14:32:30,235 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 14:32:30,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 309 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:32:30,236 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:30,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 85 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 14:32:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2025-03-03 14:32:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (56), 13 states have call predecessors, (56), 8 states have call successors, (56) [2025-03-03 14:32:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 95 transitions. [2025-03-03 14:32:30,250 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 95 transitions. Word has length 158 [2025-03-03 14:32:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:30,251 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 95 transitions. [2025-03-03 14:32:30,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-03 14:32:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 95 transitions. [2025-03-03 14:32:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-03 14:32:30,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:30,258 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 49, 35, 35, 35, 35, 35, 35, 35, 22, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:30,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:32:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:30,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:30,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 212508284, now seen corresponding path program 3 times [2025-03-03 14:32:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77453860] [2025-03-03 14:32:30,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:30,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 480 statements into 60 equivalence classes. [2025-03-03 14:32:30,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 98 of 480 statements. [2025-03-03 14:32:30,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 14:32:30,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13496 backedges. 1700 proven. 117 refuted. 0 times theorem prover too weak. 11679 trivial. 0 not checked. [2025-03-03 14:32:30,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77453860] [2025-03-03 14:32:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77453860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075169994] [2025-03-03 14:32:30,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:30,620 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:32:30,622 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:32:30,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 480 statements into 60 equivalence classes. [2025-03-03 14:32:30,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 98 of 480 statements. [2025-03-03 14:32:30,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 14:32:30,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:30,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:32:30,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13496 backedges. 3577 proven. 12 refuted. 0 times theorem prover too weak. 9907 trivial. 0 not checked. [2025-03-03 14:32:30,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13496 backedges. 1702 proven. 115 refuted. 0 times theorem prover too weak. 11679 trivial. 0 not checked. [2025-03-03 14:32:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075169994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:31,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-03 14:32:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837135656] [2025-03-03 14:32:31,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:32:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:31,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:32:31,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:32:31,980 INFO L87 Difference]: Start difference. First operand 46 states and 95 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:32:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:32,074 INFO L93 Difference]: Finished difference Result 93 states and 240 transitions. [2025-03-03 14:32:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:32:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 480 [2025-03-03 14:32:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:32,076 INFO L225 Difference]: With dead ends: 93 [2025-03-03 14:32:32,076 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:32:32,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 952 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:32:32,078 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:32,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:32:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-03 14:32:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (51), 13 states have call predecessors, (51), 8 states have call successors, (51) [2025-03-03 14:32:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2025-03-03 14:32:32,085 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 480 [2025-03-03 14:32:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:32,085 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2025-03-03 14:32:32,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:32:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2025-03-03 14:32:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-03 14:32:32,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:32,090 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 61, 35, 35, 35, 35, 35, 35, 35, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:32,097 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:32:32,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:32,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:32,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1663934924, now seen corresponding path program 4 times [2025-03-03 14:32:32,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:32,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894959051] [2025-03-03 14:32:32,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:32,312 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 492 statements into 2 equivalence classes. [2025-03-03 14:32:32,339 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 417 of 492 statements. [2025-03-03 14:32:32,340 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:32:32,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 1256 proven. 2490 refuted. 0 times theorem prover too weak. 10404 trivial. 0 not checked. [2025-03-03 14:32:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894959051] [2025-03-03 14:32:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894959051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285187582] [2025-03-03 14:32:33,048 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:33,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:33,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:33,052 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:32:33,053 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:32:33,120 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 492 statements into 2 equivalence classes. [2025-03-03 14:32:33,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 417 of 492 statements. [2025-03-03 14:32:33,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:32:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:33,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:32:33,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 4694 proven. 170 refuted. 0 times theorem prover too weak. 9286 trivial. 0 not checked. [2025-03-03 14:32:33,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 506 proven. 2500 refuted. 0 times theorem prover too weak. 11144 trivial. 0 not checked. [2025-03-03 14:32:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285187582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:34,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 15] total 27 [2025-03-03 14:32:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039399109] [2025-03-03 14:32:34,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:32:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:34,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:32:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:32:34,955 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) [2025-03-03 14:32:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:35,454 INFO L93 Difference]: Finished difference Result 140 states and 339 transitions. [2025-03-03 14:32:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 14:32:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) Word has length 492 [2025-03-03 14:32:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:35,457 INFO L225 Difference]: With dead ends: 140 [2025-03-03 14:32:35,457 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 14:32:35,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 975 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=2102, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 14:32:35,461 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 218 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:35,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 201 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:32:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 14:32:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-03 14:32:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 66 states have internal predecessors, (73), 17 states have call successors, (17), 14 states have call predecessors, (17), 9 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2025-03-03 14:32:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2025-03-03 14:32:35,480 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 492 [2025-03-03 14:32:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2025-03-03 14:32:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) [2025-03-03 14:32:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2025-03-03 14:32:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 14:32:35,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:35,485 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 78, 48, 48, 48, 48, 48, 48, 48, 30, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:35,491 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:32:35,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:35,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash -716322305, now seen corresponding path program 5 times [2025-03-03 14:32:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445912604] [2025-03-03 14:32:35,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:35,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 665 statements into 78 equivalence classes. [2025-03-03 14:32:35,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) and asserted 463 of 665 statements. [2025-03-03 14:32:35,795 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2025-03-03 14:32:35,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3735 proven. 1741 refuted. 0 times theorem prover too weak. 20663 trivial. 0 not checked. [2025-03-03 14:32:36,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445912604] [2025-03-03 14:32:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445912604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225451993] [2025-03-03 14:32:36,358 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:36,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:36,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:32:36,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:32:36,437 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 665 statements into 78 equivalence classes. [2025-03-03 14:32:36,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) and asserted 463 of 665 statements. [2025-03-03 14:32:36,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2025-03-03 14:32:36,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:36,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:32:36,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 11426 proven. 865 refuted. 0 times theorem prover too weak. 13848 trivial. 0 not checked. [2025-03-03 14:32:36,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3888 proven. 1940 refuted. 0 times theorem prover too weak. 20311 trivial. 0 not checked. [2025-03-03 14:32:39,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225451993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:39,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 28 [2025-03-03 14:32:39,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598940564] [2025-03-03 14:32:39,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:39,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:32:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:39,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:32:39,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:32:39,998 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) [2025-03-03 14:32:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:40,349 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2025-03-03 14:32:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:32:40,350 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) Word has length 665 [2025-03-03 14:32:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:40,352 INFO L225 Difference]: With dead ends: 201 [2025-03-03 14:32:40,352 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 14:32:40,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1314 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 14:32:40,353 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:40,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 233 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:32:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 14:32:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2025-03-03 14:32:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 66 states have internal predecessors, (72), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (43), 16 states have call predecessors, (43), 18 states have call successors, (43) [2025-03-03 14:32:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-03-03 14:32:40,371 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 665 [2025-03-03 14:32:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:40,372 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-03-03 14:32:40,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) [2025-03-03 14:32:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-03-03 14:32:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-03 14:32:40,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:40,377 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:40,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:32:40,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:40,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1679448066, now seen corresponding path program 6 times [2025-03-03 14:32:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080536549] [2025-03-03 14:32:40,582 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:32:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:40,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 570 statements into 78 equivalence classes. [2025-03-03 14:32:40,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) and asserted 563 of 570 statements. [2025-03-03 14:32:40,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) [2025-03-03 14:32:40,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2137 proven. 2169 refuted. 0 times theorem prover too weak. 14797 trivial. 0 not checked. [2025-03-03 14:32:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080536549] [2025-03-03 14:32:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080536549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714549459] [2025-03-03 14:32:41,368 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:32:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:41,370 INFO L229 MonitoredProcess]: Starting monitored process 8 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:32:41,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:32:41,467 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 570 statements into 78 equivalence classes. [2025-03-03 14:32:41,643 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) and asserted 563 of 570 statements. [2025-03-03 14:32:41,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 77 check-sat command(s) [2025-03-03 14:32:41,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:41,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:32:41,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2114 proven. 2176 refuted. 0 times theorem prover too weak. 14813 trivial. 0 not checked. [2025-03-03 14:32:41,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2120 proven. 2228 refuted. 0 times theorem prover too weak. 14755 trivial. 0 not checked. [2025-03-03 14:32:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714549459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:44,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:44,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 27 [2025-03-03 14:32:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176315330] [2025-03-03 14:32:44,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:32:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:32:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:32:44,014 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (32), 17 states have call predecessors, (32), 17 states have call successors, (32) [2025-03-03 14:32:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:44,454 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2025-03-03 14:32:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 14:32:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (32), 17 states have call predecessors, (32), 17 states have call successors, (32) Word has length 570 [2025-03-03 14:32:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:44,457 INFO L225 Difference]: With dead ends: 278 [2025-03-03 14:32:44,460 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 14:32:44,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1126 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=740, Invalid=2122, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:32:44,461 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 152 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:44,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 170 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:32:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 14:32:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 121. [2025-03-03 14:32:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 83 states have internal predecessors, (91), 23 states have call successors, (23), 19 states have call predecessors, (23), 10 states have return successors, (58), 18 states have call predecessors, (58), 23 states have call successors, (58) [2025-03-03 14:32:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 172 transitions. [2025-03-03 14:32:44,476 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 172 transitions. Word has length 570 [2025-03-03 14:32:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:44,476 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 172 transitions. [2025-03-03 14:32:44,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (32), 17 states have call predecessors, (32), 17 states have call successors, (32) [2025-03-03 14:32:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 172 transitions. [2025-03-03 14:32:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-03 14:32:44,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:44,478 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:44,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:44,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:44,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash -63544319, now seen corresponding path program 7 times [2025-03-03 14:32:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404860523] [2025-03-03 14:32:44,680 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:32:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:44,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-03 14:32:44,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-03 14:32:44,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:44,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:32:44,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:32:44,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-03 14:32:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-03 14:32:44,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:44,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:32:44,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:32:44,800 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:32:44,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:32:44,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:32:44,803 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2025-03-03 14:32:44,857 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:32:44,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:32:44 BoogieIcfgContainer [2025-03-03 14:32:44,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:32:44,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:32:44,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:32:44,860 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:32:44,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:26" (3/4) ... [2025-03-03 14:32:44,861 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:32:44,929 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 258. [2025-03-03 14:32:45,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:32:45,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:32:45,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:32:45,045 INFO L158 Benchmark]: Toolchain (without parser) took 18801.44ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 105.3MB in the beginning and 223.6MB in the end (delta: -118.3MB). Peak memory consumption was 212.9MB. Max. memory is 16.1GB. [2025-03-03 14:32:45,045 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:45,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.04ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 93.8MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:32:45,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.41ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:45,046 INFO L158 Benchmark]: Boogie Preprocessor took 23.52ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 92.5MB in the end (delta: 207.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:45,046 INFO L158 Benchmark]: IcfgBuilder took 177.04ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 82.1MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:32:45,046 INFO L158 Benchmark]: TraceAbstraction took 18241.32ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 81.1MB in the beginning and 240.4MB in the end (delta: -159.3MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2025-03-03 14:32:45,046 INFO L158 Benchmark]: Witness Printer took 185.39ms. Allocated memory is still 478.2MB. Free memory was 240.4MB in the beginning and 223.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:32:45,047 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.42ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.04ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 93.8MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.41ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.52ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 92.5MB in the end (delta: 207.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 177.04ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 82.1MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18241.32ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 81.1MB in the beginning and 240.4MB in the end (delta: -159.3MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. * Witness Printer took 185.39ms. Allocated memory is still 478.2MB. Free memory was 240.4MB in the beginning and 223.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] COND FALSE !(x > 46) VAL [x=8] [L32] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L32] RET, EXPR fibonacci(x) VAL [x=8] [L32] int result = fibonacci(x); [L33] COND FALSE !(x < 8 || result >= 34) [L36] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 10, TraceHistogramMax: 97, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 1000 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 798 mSDsCounter, 515 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1595 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 515 mSolverCounterUnsat, 202 mSDtfsCounter, 1595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5075 GetRequests, 4823 SyntacticMatches, 40 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=9, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 76 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 5366 NumberOfCodeBlocks, 4034 NumberOfCodeBlocksAsserted, 303 NumberOfCheckSat, 7323 ConstructedInterpolants, 0 QuantifiedInterpolants, 9591 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3984 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 205110/223029 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-03 14:32:45,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 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