./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:29:24,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:29:24,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:29:24,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:29:24,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:29:24,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:29:24,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:29:24,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:29:24,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:29:24,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:29:24,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:29:24,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:29:24,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:29:24,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:29:24,632 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:29:24,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:29:24,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:29:24,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:29:24,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:29:24,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:29:24,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:29:24,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:29:24,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:29:24,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:29:24,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:29:24,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:29:24,635 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-jdk21/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 ! overflow) ) 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 -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2025-02-06 14:29:24,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:29:24,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:29:24,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:29:24,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:29:24,853 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:29:24,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2025-02-06 14:29:25,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f74922b80/99be316e524a4a1293394640954bf28f/FLAG87751f1dd [2025-02-06 14:29:26,179 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:29:26,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2025-02-06 14:29:26,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f74922b80/99be316e524a4a1293394640954bf28f/FLAG87751f1dd [2025-02-06 14:29:26,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f74922b80/99be316e524a4a1293394640954bf28f [2025-02-06 14:29:26,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:29:26,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:29:26,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:29:26,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:29:26,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:29:26,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108b998c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26, skipping insertion in model container [2025-02-06 14:29:26,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:29:26,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:29:26,361 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:29:26,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:29:26,379 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:29:26,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26 WrapperNode [2025-02-06 14:29:26,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:29:26,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:29:26,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:29:26,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:29:26,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,402 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-02-06 14:29:26,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:29:26,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:29:26,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:29:26,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:29:26,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,420 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-02-06 14:29:26,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:29:26,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:29:26,428 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:29:26,428 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:29:26,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (1/1) ... [2025-02-06 14:29:26,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:29:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:26,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:29:26,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:29:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-02-06 14:29:26,476 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-02-06 14:29:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:29:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:29:26,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:29:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:29:26,519 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:29:26,520 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:29:26,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-02-06 14:29:26,622 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 14:29:26,623 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:29:26,630 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:29:26,633 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:29:26,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:29:26 BoogieIcfgContainer [2025-02-06 14:29:26,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:29:26,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:29:26,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:29:26,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:29:26,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:29:26" (1/3) ... [2025-02-06 14:29:26,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e108e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:29:26, skipping insertion in model container [2025-02-06 14:29:26,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:26" (2/3) ... [2025-02-06 14:29:26,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e108e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:29:26, skipping insertion in model container [2025-02-06 14:29:26,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:29:26" (3/3) ... [2025-02-06 14:29:26,642 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2025-02-06 14:29:26,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:29:26,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci02.c that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-06 14:29:26,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:29:26,708 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;@7077be9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:29:26,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 14:29:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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-02-06 14:29:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:29:26,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:26,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:26,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:26,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1001399972, now seen corresponding path program 1 times [2025-02-06 14:29:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:26,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646356499] [2025-02-06 14:29:26,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:29:26,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:29:26,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:26,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646356499] [2025-02-06 14:29:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646356499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:29:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427693168] [2025-02-06 14:29:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:29:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:26,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:29:26,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:29:26,859 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:29:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:26,891 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-02-06 14:29:26,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:29:26,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 14:29:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:26,896 INFO L225 Difference]: With dead ends: 36 [2025-02-06 14:29:26,896 INFO L226 Difference]: Without dead ends: 24 [2025-02-06 14:29:26,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:29:26,899 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:26,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-06 14:29:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-06 14:29:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-06 14:29:26,922 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-02-06 14:29:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:26,922 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-06 14:29:26,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:29:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-06 14:29:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:29:26,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:26,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:26,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:29:26,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:26,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash 978628045, now seen corresponding path program 1 times [2025-02-06 14:29:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812610626] [2025-02-06 14:29:26,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:26,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:26,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:29:26,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:29:26,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:26,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812610626] [2025-02-06 14:29:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812610626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344700151] [2025-02-06 14:29:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:26,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:26,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:26,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:26,984 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:29:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:27,033 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-02-06 14:29:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:29:27,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 14:29:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:27,034 INFO L225 Difference]: With dead ends: 24 [2025-02-06 14:29:27,034 INFO L226 Difference]: Without dead ends: 22 [2025-02-06 14:29:27,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:29:27,035 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:27,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-06 14:29:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-02-06 14:29:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-02-06 14:29:27,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-02-06 14:29:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:27,039 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-06 14:29:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:29:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-02-06 14:29:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:29:27,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:27,040 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:27,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:29:27,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash -989645326, now seen corresponding path program 1 times [2025-02-06 14:29:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:27,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531937620] [2025-02-06 14:29:27,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:27,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:27,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:29:27,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:29:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:27,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:29:27,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:27,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531937620] [2025-02-06 14:29:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531937620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:27,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398741053] [2025-02-06 14:29:27,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:27,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:27,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:27,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:27,207 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:27,250 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-02-06 14:29:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:29:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-06 14:29:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:27,252 INFO L225 Difference]: With dead ends: 34 [2025-02-06 14:29:27,252 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 14:29:27,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:27,253 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:27,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 14:29:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-06 14:29:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:29:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-02-06 14:29:27,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-02-06 14:29:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:27,259 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-02-06 14:29:27,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-02-06 14:29:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 14:29:27,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:27,260 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:27,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:29:27,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1650141125, now seen corresponding path program 1 times [2025-02-06 14:29:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489302171] [2025-02-06 14:29:27,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:27,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 14:29:27,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 14:29:27,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:27,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:29:27,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489302171] [2025-02-06 14:29:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489302171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496009714] [2025-02-06 14:29:27,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:27,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:29:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 14:29:27,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 14:29:27,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:27,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:29:27,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:27,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:29:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496009714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:27,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-02-06 14:29:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005373729] [2025-02-06 14:29:27,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 14:29:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:27,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 14:29:27,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:29:27,608 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:29:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:27,913 INFO L93 Difference]: Finished difference Result 126 states and 180 transitions. [2025-02-06 14:29:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 14:29:27,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2025-02-06 14:29:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:27,915 INFO L225 Difference]: With dead ends: 126 [2025-02-06 14:29:27,915 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 14:29:27,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-06 14:29:27,916 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:27,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 179 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:29:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 14:29:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2025-02-06 14:29:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 13 states have call predecessors, (32), 10 states have call successors, (32) [2025-02-06 14:29:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2025-02-06 14:29:27,933 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2025-02-06 14:29:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:27,933 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2025-02-06 14:29:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:29:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2025-02-06 14:29:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:29:27,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:27,934 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:27,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:29:28,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:28,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:28,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 812217045, now seen corresponding path program 2 times [2025-02-06 14:29:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898423005] [2025-02-06 14:29:28,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:28,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 14:29:28,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:29:28,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:28,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:29:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898423005] [2025-02-06 14:29:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898423005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337398917] [2025-02-06 14:29:28,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:28,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:28,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:28,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:29:28,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 14:29:28,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:29:28,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:28,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:28,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:29:28,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:29:28,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:29:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337398917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:28,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:29:28,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-06 14:29:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841167259] [2025-02-06 14:29:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:28,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:28,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:29:28,310 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:28,338 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2025-02-06 14:29:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:29:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-02-06 14:29:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:28,341 INFO L225 Difference]: With dead ends: 101 [2025-02-06 14:29:28,341 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 14:29:28,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:29:28,342 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:28,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 14:29:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-02-06 14:29:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2025-02-06 14:29:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-02-06 14:29:28,360 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 30 [2025-02-06 14:29:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-02-06 14:29:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-02-06 14:29:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:29:28,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:28,361 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:28,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:29:28,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:28,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:28,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash -591075408, now seen corresponding path program 1 times [2025-02-06 14:29:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335223768] [2025-02-06 14:29:28,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:28,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:29:28,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:29:28,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:28,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:29:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335223768] [2025-02-06 14:29:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335223768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080622202] [2025-02-06 14:29:28,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:28,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:28,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:28,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:28,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:29:28,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:29:28,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:29:28,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:28,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:28,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 14:29:28,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:28,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:29:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080622202] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:28,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:28,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 14:29:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632853124] [2025-02-06 14:29:28,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:28,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 14:29:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:28,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 14:29:28,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-02-06 14:29:28,889 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:29:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:29,425 INFO L93 Difference]: Finished difference Result 287 states and 459 transitions. [2025-02-06 14:29:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 14:29:29,425 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2025-02-06 14:29:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:29,426 INFO L225 Difference]: With dead ends: 287 [2025-02-06 14:29:29,426 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 14:29:29,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-02-06 14:29:29,432 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 140 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:29,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 324 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 14:29:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 14:29:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 175. [2025-02-06 14:29:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 137 states have (on average 1.094890510948905) internal successors, (150), 137 states have internal predecessors, (150), 22 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (83), 31 states have call predecessors, (83), 21 states have call successors, (83) [2025-02-06 14:29:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2025-02-06 14:29:29,466 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 31 [2025-02-06 14:29:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:29,466 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2025-02-06 14:29:29,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:29:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2025-02-06 14:29:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 14:29:29,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:29,467 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:29,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:29:29,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:29,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1168656193, now seen corresponding path program 1 times [2025-02-06 14:29:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:29,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883002750] [2025-02-06 14:29:29,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:29,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 14:29:29,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 14:29:29,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:29,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-06 14:29:29,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883002750] [2025-02-06 14:29:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883002750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558353792] [2025-02-06 14:29:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:29,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:29,727 INFO L87 Difference]: Start difference. First operand 175 states and 255 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:29,754 INFO L93 Difference]: Finished difference Result 189 states and 277 transitions. [2025-02-06 14:29:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:29:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-02-06 14:29:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:29,756 INFO L225 Difference]: With dead ends: 189 [2025-02-06 14:29:29,756 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 14:29:29,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:29,757 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:29,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 14:29:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2025-02-06 14:29:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.0909090909090908) internal successors, (156), 142 states have internal predecessors, (156), 23 states have call successors, (23), 6 states have call predecessors, (23), 14 states have return successors, (89), 33 states have call predecessors, (89), 22 states have call successors, (89) [2025-02-06 14:29:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2025-02-06 14:29:29,772 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 50 [2025-02-06 14:29:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2025-02-06 14:29:29,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:29:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2025-02-06 14:29:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 14:29:29,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:29,775 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 7, 7, 7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:29:29,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2100198482, now seen corresponding path program 1 times [2025-02-06 14:29:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401855785] [2025-02-06 14:29:29,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:29,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 14:29:29,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 14:29:29,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:29,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-02-06 14:29:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401855785] [2025-02-06 14:29:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401855785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911766789] [2025-02-06 14:29:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:29,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:29,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:29,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:29:29,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 14:29:29,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 14:29:29,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:29,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:29,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 14:29:29,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 14:29:30,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 35 proven. 175 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 14:29:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911766789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:30,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 24 [2025-02-06 14:29:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088264171] [2025-02-06 14:29:30,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:30,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:29:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:30,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:29:30,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:29:30,241 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-06 14:29:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:30,734 INFO L93 Difference]: Finished difference Result 496 states and 797 transitions. [2025-02-06 14:29:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 14:29:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 82 [2025-02-06 14:29:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:30,738 INFO L225 Difference]: With dead ends: 496 [2025-02-06 14:29:30,740 INFO L226 Difference]: Without dead ends: 329 [2025-02-06 14:29:30,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 144 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 14:29:30,743 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 245 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:30,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 479 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:29:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-06 14:29:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 302. [2025-02-06 14:29:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 238 states have (on average 1.096638655462185) internal successors, (261), 237 states have internal predecessors, (261), 38 states have call successors, (38), 11 states have call predecessors, (38), 24 states have return successors, (115), 53 states have call predecessors, (115), 37 states have call successors, (115) [2025-02-06 14:29:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 414 transitions. [2025-02-06 14:29:30,776 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 414 transitions. Word has length 82 [2025-02-06 14:29:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:30,777 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 414 transitions. [2025-02-06 14:29:30,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-06 14:29:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 414 transitions. [2025-02-06 14:29:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 14:29:30,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:30,781 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 10, 10, 10, 10, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:30,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 14:29:30,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 14:29:30,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash 155991522, now seen corresponding path program 1 times [2025-02-06 14:29:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:30,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098040560] [2025-02-06 14:29:30,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:30,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 14:29:30,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 14:29:30,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:30,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-02-06 14:29:31,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098040560] [2025-02-06 14:29:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098040560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751750172] [2025-02-06 14:29:31,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:31,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:31,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:31,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:29:31,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 14:29:31,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 14:29:31,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:31,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:31,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 14:29:31,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 366 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:29:31,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 226 proven. 158 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 14:29:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751750172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:31,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 24 [2025-02-06 14:29:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112374629] [2025-02-06 14:29:31,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:31,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:29:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:31,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:29:31,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:29:31,608 INFO L87 Difference]: Start difference. First operand 302 states and 414 transitions. Second operand has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 15 states have internal predecessors, (85), 12 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 14:29:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:31,999 INFO L93 Difference]: Finished difference Result 579 states and 828 transitions. [2025-02-06 14:29:31,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 14:29:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 15 states have internal predecessors, (85), 12 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-02-06 14:29:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:32,001 INFO L225 Difference]: With dead ends: 579 [2025-02-06 14:29:32,001 INFO L226 Difference]: Without dead ends: 298 [2025-02-06 14:29:32,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 172 SyntacticMatches, 19 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 14:29:32,005 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 335 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:32,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 159 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:29:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-06 14:29:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2025-02-06 14:29:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 216 states have (on average 1.0972222222222223) internal successors, (237), 217 states have internal predecessors, (237), 34 states have call successors, (34), 12 states have call predecessors, (34), 23 states have return successors, (69), 45 states have call predecessors, (69), 33 states have call successors, (69) [2025-02-06 14:29:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2025-02-06 14:29:32,025 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 102 [2025-02-06 14:29:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:32,025 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2025-02-06 14:29:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 15 states have internal predecessors, (85), 12 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 14:29:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2025-02-06 14:29:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 14:29:32,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:32,026 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:32,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 14:29:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:32,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918755, now seen corresponding path program 2 times [2025-02-06 14:29:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419601372] [2025-02-06 14:29:32,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:32,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-02-06 14:29:32,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 14:29:32,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:32,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 14:29:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419601372] [2025-02-06 14:29:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419601372] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102674792] [2025-02-06 14:29:32,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:32,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:32,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:32,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:29:32,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-02-06 14:29:32,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 14:29:32,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:32,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:32,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 14:29:32,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 43 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:29:32,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 9 proven. 231 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 14:29:32,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102674792] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:32,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20, 21] total 24 [2025-02-06 14:29:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209553521] [2025-02-06 14:29:32,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:32,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:29:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:32,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:29:32,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:29:32,847 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (16), 9 states have call predecessors, (16), 4 states have return successors, (8), 2 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-06 14:29:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:33,154 INFO L93 Difference]: Finished difference Result 444 states and 561 transitions. [2025-02-06 14:29:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 14:29:33,154 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (16), 9 states have call predecessors, (16), 4 states have return successors, (8), 2 states have call predecessors, (8), 7 states have call successors, (8) Word has length 80 [2025-02-06 14:29:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:33,156 INFO L225 Difference]: With dead ends: 444 [2025-02-06 14:29:33,156 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 14:29:33,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 134 SyntacticMatches, 17 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 14:29:33,158 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 237 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:33,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 376 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:29:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 14:29:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-02-06 14:29:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 139 states have (on average 1.143884892086331) internal successors, (159), 140 states have internal predecessors, (159), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 23 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:29:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 206 transitions. [2025-02-06 14:29:33,165 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 206 transitions. Word has length 80 [2025-02-06 14:29:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:33,166 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 206 transitions. [2025-02-06 14:29:33,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (16), 9 states have call predecessors, (16), 4 states have return successors, (8), 2 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-06 14:29:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 206 transitions. [2025-02-06 14:29:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 14:29:33,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:33,166 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:33,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 14:29:33,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 14:29:33,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:33,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash 556285496, now seen corresponding path program 3 times [2025-02-06 14:29:33,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:33,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197979156] [2025-02-06 14:29:33,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:29:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:33,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 11 equivalence classes. [2025-02-06 14:29:33,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 81 statements. [2025-02-06 14:29:33,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 14:29:33,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-06 14:29:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197979156] [2025-02-06 14:29:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197979156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735028319] [2025-02-06 14:29:33,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:29:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:33,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:33,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:29:33,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 11 equivalence classes. [2025-02-06 14:29:33,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 81 statements. [2025-02-06 14:29:33,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 14:29:33,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:33,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:29:33,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-02-06 14:29:33,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-06 14:29:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735028319] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:33,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:33,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-02-06 14:29:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757224750] [2025-02-06 14:29:33,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:33,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 14:29:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:33,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 14:29:33,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:29:33,657 INFO L87 Difference]: Start difference. First operand 176 states and 206 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 14:29:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:33,719 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2025-02-06 14:29:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:29:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 81 [2025-02-06 14:29:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:33,720 INFO L225 Difference]: With dead ends: 178 [2025-02-06 14:29:33,720 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 14:29:33,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:29:33,721 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:33,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 14:29:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2025-02-06 14:29:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.1240875912408759) internal successors, (154), 139 states have internal predecessors, (154), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:29:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2025-02-06 14:29:33,728 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 81 [2025-02-06 14:29:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2025-02-06 14:29:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 14:29:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2025-02-06 14:29:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 14:29:33,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:33,729 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-06 14:29:33,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 14:29:33,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:33,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:33,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash -643062752, now seen corresponding path program 2 times [2025-02-06 14:29:33,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:33,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469182635] [2025-02-06 14:29:33,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:33,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-02-06 14:29:33,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 14:29:33,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:33,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-02-06 14:29:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469182635] [2025-02-06 14:29:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469182635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152755041] [2025-02-06 14:29:34,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:34,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:34,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:34,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:34,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:29:34,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-02-06 14:29:34,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 14:29:34,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:34,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:29:34,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-02-06 14:29:34,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 14:29:34,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152755041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:34,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-02-06 14:29:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984045855] [2025-02-06 14:29:34,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:34,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 14:29:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:34,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 14:29:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-02-06 14:29:34,511 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 14:29:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:34,594 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2025-02-06 14:29:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 14:29:34,594 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) Word has length 113 [2025-02-06 14:29:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:34,596 INFO L225 Difference]: With dead ends: 174 [2025-02-06 14:29:34,596 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 14:29:34,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-02-06 14:29:34,597 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:34,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 228 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:29:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 14:29:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-06 14:29:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.0583941605839415) internal successors, (145), 138 states have internal predecessors, (145), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:29:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2025-02-06 14:29:34,607 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 113 [2025-02-06 14:29:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:34,607 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2025-02-06 14:29:34,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 14:29:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2025-02-06 14:29:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 14:29:34,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:34,609 INFO L218 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2025-02-06 14:29:34,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:29:34,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:34,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:34,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:34,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1252282038, now seen corresponding path program 4 times [2025-02-06 14:29:34,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:34,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957954464] [2025-02-06 14:29:34,810 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:29:34,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:34,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 167 statements into 2 equivalence classes. [2025-02-06 14:29:34,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 14:29:34,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:29:34,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-02-06 14:29:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957954464] [2025-02-06 14:29:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957954464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179415343] [2025-02-06 14:29:35,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:29:35,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:35,253 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:35,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:29:35,284 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 167 statements into 2 equivalence classes. [2025-02-06 14:29:35,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 14:29:35,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:29:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:35,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 14:29:35,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-02-06 14:29:35,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 14:29:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179415343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:36,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2025-02-06 14:29:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136527569] [2025-02-06 14:29:36,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:36,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 14:29:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:36,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 14:29:36,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-02-06 14:29:36,324 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 14:29:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:36,388 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2025-02-06 14:29:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 14:29:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 167 [2025-02-06 14:29:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:36,390 INFO L225 Difference]: With dead ends: 174 [2025-02-06 14:29:36,390 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 14:29:36,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 320 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-02-06 14:29:36,391 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:36,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 187 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:29:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 14:29:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-06 14:29:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 138 states have internal predecessors, (141), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:29:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2025-02-06 14:29:36,399 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 167 [2025-02-06 14:29:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:36,399 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2025-02-06 14:29:36,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 14:29:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2025-02-06 14:29:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-06 14:29:36,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:36,403 INFO L218 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2025-02-06 14:29:36,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 14:29:36,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:36,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:36,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:36,605 INFO L85 PathProgramCache]: Analyzing trace with hash -300200331, now seen corresponding path program 5 times [2025-02-06 14:29:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:36,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332388927] [2025-02-06 14:29:36,605 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 14:29:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:36,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 410 statements into 31 equivalence classes. [2025-02-06 14:29:36,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 410 of 410 statements. [2025-02-06 14:29:36,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-02-06 14:29:36,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 998 proven. 1424 refuted. 0 times theorem prover too weak. 3562 trivial. 0 not checked. [2025-02-06 14:29:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332388927] [2025-02-06 14:29:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332388927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093325673] [2025-02-06 14:29:38,759 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 14:29:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:38,763 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:38,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 14:29:38,810 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 410 statements into 31 equivalence classes. [2025-02-06 14:29:38,904 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 410 of 410 statements. [2025-02-06 14:29:38,905 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-02-06 14:29:38,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:38,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-06 14:29:38,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2025-02-06 14:29:39,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2025-02-06 14:29:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093325673] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:44,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 29] total 47 [2025-02-06 14:29:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364074159] [2025-02-06 14:29:44,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 14:29:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:44,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 14:29:44,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1730, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 14:29:44,549 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand has 48 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 48 states have internal predecessors, (124), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-02-06 14:29:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:44,645 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2025-02-06 14:29:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 14:29:44,645 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 48 states have internal predecessors, (124), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) Word has length 410 [2025-02-06 14:29:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:44,647 INFO L225 Difference]: With dead ends: 174 [2025-02-06 14:29:44,647 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 14:29:44,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 798 SyntacticMatches, 55 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2573 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=575, Invalid=1875, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 14:29:44,649 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:44,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:29:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 14:29:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-06 14:29:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.0072992700729928) internal successors, (138), 138 states have internal predecessors, (138), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:29:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2025-02-06 14:29:44,654 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 410 [2025-02-06 14:29:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:44,655 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2025-02-06 14:29:44,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 48 states have internal predecessors, (124), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-02-06 14:29:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2025-02-06 14:29:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-02-06 14:29:44,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:44,669 INFO L218 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2025-02-06 14:29:44,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 14:29:44,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 14:29:44,870 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:29:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1029407192, now seen corresponding path program 6 times [2025-02-06 14:29:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985889613] [2025-02-06 14:29:44,871 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 14:29:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:44,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1065 statements into 83 equivalence classes. [2025-02-06 14:29:45,089 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) and asserted 1065 of 1065 statements. [2025-02-06 14:29:45,089 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2025-02-06 14:29:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7341 proven. 10021 refuted. 0 times theorem prover too weak. 24104 trivial. 0 not checked. [2025-02-06 14:29:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985889613] [2025-02-06 14:29:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985889613] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650708932] [2025-02-06 14:29:57,666 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 14:29:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:57,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:57,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 14:29:57,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1065 statements into 83 equivalence classes. [2025-02-06 14:29:58,085 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) and asserted 1065 of 1065 statements. [2025-02-06 14:29:58,085 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2025-02-06 14:29:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:58,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-02-06 14:29:58,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-02-06 14:29:58,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2025-02-06 14:30:29,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650708932] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:29,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:29,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 41] total 60 [2025-02-06 14:30:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801166294] [2025-02-06 14:30:29,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-06 14:30:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:29,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-06 14:30:29,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 14:30:29,994 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) [2025-02-06 14:30:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:30,079 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2025-02-06 14:30:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 14:30:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) Word has length 1065 [2025-02-06 14:30:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:30,081 INFO L225 Difference]: With dead ends: 173 [2025-02-06 14:30:30,081 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:30:30,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2346 GetRequests, 2094 SyntacticMatches, 192 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7056 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=852, Invalid=2930, Unknown=0, NotChecked=0, Total=3782 [2025-02-06 14:30:30,084 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:30,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:30:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:30:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:30:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:30:30,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1065 [2025-02-06 14:30:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:30,085 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:30:30,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) [2025-02-06 14:30:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:30:30,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:30:30,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 14:30:30,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 14:30:30,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 14:30:30,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 14:30:30,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 14:30:30,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 14:30:30,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 14:30:30,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 14:30:30,292 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 14:30:30,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:30:31,096 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:30:31,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:30:31 BoogieIcfgContainer [2025-02-06 14:30:31,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:30:31,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:30:31,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:30:31,100 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:30:31,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:29:26" (3/4) ... [2025-02-06 14:30:31,101 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:30:31,105 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-02-06 14:30:31,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 14:30:31,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:30:31,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:30:31,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:30:31,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:30:31,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:30:31,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:30:31,158 INFO L158 Benchmark]: Toolchain (without parser) took 64920.85ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 113.6MB in the beginning and 963.2MB in the end (delta: -849.6MB). Peak memory consumption was 453.1MB. Max. memory is 16.1GB. [2025-02-06 14:30:31,158 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:31,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.61ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 103.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:30:31,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.81ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.5MB in the end (delta: 900.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:31,158 INFO L158 Benchmark]: Boogie Preprocessor took 25.30ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:31,158 INFO L158 Benchmark]: IcfgBuilder took 205.03ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:30:31,159 INFO L158 Benchmark]: TraceAbstraction took 64464.42ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 90.0MB in the beginning and 971.3MB in the end (delta: -881.3MB). Peak memory consumption was 428.0MB. Max. memory is 16.1GB. [2025-02-06 14:30:31,159 INFO L158 Benchmark]: Witness Printer took 57.47ms. Allocated memory is still 1.5GB. Free memory was 971.3MB in the beginning and 963.2MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:31,160 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.86ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.61ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 103.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.81ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.5MB in the end (delta: 900.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.30ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 205.03ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 64464.42ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 90.0MB in the beginning and 971.3MB in the end (delta: -881.3MB). Peak memory consumption was 428.0MB. Max. memory is 16.1GB. * Witness Printer took 57.47ms. Allocated memory is still 1.5GB. Free memory was 971.3MB in the beginning and 963.2MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 63.6s, OverallIterations: 15, TraceHistogramMax: 109, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1167 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1137 mSDsluCounter, 2674 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2243 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3376 IncrementalHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 431 mSDtfsCounter, 3376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4812 GetRequests, 4161 SyntacticMatches, 314 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11566 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=8, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 56.9s InterpolantComputationTime, 4464 NumberOfCodeBlocks, 4368 NumberOfCodeBlocksAsserted, 262 NumberOfCheckSat, 6583 ConstructedInterpolants, 0 QuantifiedInterpolants, 15680 SizeOfPredicates, 26 NumberOfNonLiveVariables, 4150 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 119990/150351 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 14:30:31,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Result: TRUE