./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d1a4b1841ad6fa39491d7c82c38d46725a7eceb7c19c007d9e026b8eedadeb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:27:46,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:27:46,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:27:46,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:27:46,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:27:46,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:27:46,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:27:46,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:27:46,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:27:46,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:27:46,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:27:46,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:27:46,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:27:46,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:27:46,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:27:46,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:27:46,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:27:46,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:27:46,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:27:46,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:27:46,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:27:46,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:27:46,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:27:46,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:27:46,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 8d1a4b1841ad6fa39491d7c82c38d46725a7eceb7c19c007d9e026b8eedadeb5 [2025-03-04 11:27:46,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:27:46,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:27:46,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:27:46,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:27:46,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:27:46,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2025-03-04 11:27:47,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b32f76a60/710c11843182437ca711de53ac70968b/FLAG571073608 [2025-03-04 11:27:47,943 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:27:47,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2025-03-04 11:27:47,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b32f76a60/710c11843182437ca711de53ac70968b/FLAG571073608 [2025-03-04 11:27:47,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b32f76a60/710c11843182437ca711de53ac70968b [2025-03-04 11:27:47,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:27:47,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:27:47,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:27:47,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:27:47,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:27:47,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:27:47" (1/1) ... [2025-03-04 11:27:47,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:47, skipping insertion in model container [2025-03-04 11:27:47,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:27:47" (1/1) ... [2025-03-04 11:27:47,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:27:48,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:27:48,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:27:48,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:27:48,117 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:27:48,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48 WrapperNode [2025-03-04 11:27:48,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:27:48,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:27:48,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:27:48,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:27:48,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,140 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-04 11:27:48,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:27:48,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:27:48,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:27:48,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:27:48,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,153 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:27:48,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:27:48,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:27:48,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:27:48,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:27:48,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (1/1) ... [2025-03-04 11:27:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:27:48,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:48,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:27:48,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:27:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-04 11:27:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-04 11:27:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:27:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:27:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:27:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:27:48,249 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:27:48,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:27:48,331 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:27:48,367 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-04 11:27:48,367 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:27:48,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:27:48,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:27:48,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:27:48 BoogieIcfgContainer [2025-03-04 11:27:48,375 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:27:48,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:27:48,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:27:48,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:27:48,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:27:47" (1/3) ... [2025-03-04 11:27:48,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c465ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:27:48, skipping insertion in model container [2025-03-04 11:27:48,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:27:48" (2/3) ... [2025-03-04 11:27:48,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c465ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:27:48, skipping insertion in model container [2025-03-04 11:27:48,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:27:48" (3/3) ... [2025-03-04 11:27:48,382 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2025-03-04 11:27:48,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:27:48,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci04.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:27:48,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:27:48,448 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;@57d0360f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:27:48,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:27:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:27:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:27:48,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:48,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:48,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:48,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 154990982, now seen corresponding path program 1 times [2025-03-04 11:27:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:48,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552301705] [2025-03-04 11:27:48,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:48,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:27:48,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:27:48,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:48,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:27:48,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:48,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552301705] [2025-03-04 11:27:48,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552301705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:48,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:48,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:27:48,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196700745] [2025-03-04 11:27:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:48,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:27:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:48,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:27:48,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:27:48,619 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 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.5) internal successors, (7), 3 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-03-04 11:27:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:48,659 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-04 11:27:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:27:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03-04 11:27:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:48,667 INFO L225 Difference]: With dead ends: 37 [2025-03-04 11:27:48,668 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 11:27:48,670 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-03-04 11:27:48,672 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 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-03-04 11:27:48,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 11:27:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-04 11:27:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 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-03-04 11:27:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-04 11:27:48,703 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2025-03-04 11:27:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:48,704 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-04 11:27:48,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03-04 11:27:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-04 11:27:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:27:48,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:48,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:48,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:27:48,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:48,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 509753131, now seen corresponding path program 1 times [2025-03-04 11:27:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:48,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472103182] [2025-03-04 11:27:48,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:27:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:27:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:27:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472103182] [2025-03-04 11:27:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472103182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:27:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849245647] [2025-03-04 11:27:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:48,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:48,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:48,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:48,799 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-03-04 11:27:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:48,864 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-04 11:27:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2025-03-04 11:27:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:48,865 INFO L225 Difference]: With dead ends: 25 [2025-03-04 11:27:48,865 INFO L226 Difference]: Without dead ends: 23 [2025-03-04 11:27:48,865 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-03-04 11:27:48,866 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:48,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-04 11:27:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-04 11:27:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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-03-04 11:27:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 11:27:48,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2025-03-04 11:27:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:48,870 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 11:27:48,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-03-04 11:27:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 11:27:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:27:48,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:48,871 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:48,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:27:48,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:48,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1640876003, now seen corresponding path program 1 times [2025-03-04 11:27:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220938231] [2025-03-04 11:27:48,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:48,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:27:48,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:27:48,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:48,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:27:49,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:49,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220938231] [2025-03-04 11:27:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220938231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:27:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16135217] [2025-03-04 11:27:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:49,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:49,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:49,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:49,031 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-03-04 11:27:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:49,060 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-04 11:27:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:49,061 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 30 [2025-03-04 11:27:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:49,062 INFO L225 Difference]: With dead ends: 35 [2025-03-04 11:27:49,062 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 11:27:49,062 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-03-04 11:27:49,063 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:49,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 11:27:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-04 11:27:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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-03-04 11:27:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-04 11:27:49,068 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 30 [2025-03-04 11:27:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:49,068 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-04 11:27:49,068 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-03-04 11:27:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-04 11:27:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:27:49,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:49,069 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-03-04 11:27:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:27:49,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:49,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash -119709208, now seen corresponding path program 1 times [2025-03-04 11:27:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:49,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341922506] [2025-03-04 11:27:49,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:49,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:27:49,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:27:49,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:49,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:27:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341922506] [2025-03-04 11:27:49,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341922506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054048453] [2025-03-04 11:27:49,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:49,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:49,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:49,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:27:49,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:27:49,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:27:49,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:49,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:49,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:27:49,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:27:49,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:27:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054048453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:49,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 11:27:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313964160] [2025-03-04 11:27:49,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:49,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:27:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:49,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:27:49,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:27:49,445 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:27:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:49,665 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-03-04 11:27:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:27:49,665 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-03-04 11:27:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:49,666 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:27:49,666 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 11:27:49,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:27:49,668 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:49,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 92 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 11:27:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-04 11:27:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:27:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-03-04 11:27:49,675 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2025-03-04 11:27:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-03-04 11:27:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:27:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2025-03-04 11:27:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:27:49,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:49,677 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, 1] [2025-03-04 11:27:49,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:27:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:49,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1220480843, now seen corresponding path program 2 times [2025-03-04 11:27:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761050249] [2025-03-04 11:27:49,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:49,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 11:27:49,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:27:49,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:49,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:49,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761050249] [2025-03-04 11:27:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761050249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934236250] [2025-03-04 11:27:49,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:49,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:49,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:49,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:27:49,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 11:27:49,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:27:49,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:49,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:49,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:27:49,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:50,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:27:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934236250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:27:50,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:27:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134060667] [2025-03-04 11:27:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:50,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:50,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:50,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:27:50,031 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-03-04 11:27:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:50,056 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-04 11:27:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 25 [2025-03-04 11:27:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:50,057 INFO L225 Difference]: With dead ends: 60 [2025-03-04 11:27:50,057 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 11:27:50,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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-03-04 11:27:50,058 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 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-03-04 11:27:50,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 11:27:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-04 11:27:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:27:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-03-04 11:27:50,071 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2025-03-04 11:27:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:50,071 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-03-04 11:27:50,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-03-04 11:27:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-03-04 11:27:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:27:50,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:50,073 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, 1, 1] [2025-03-04 11:27:50,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:27:50,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:50,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:50,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash -819799558, now seen corresponding path program 1 times [2025-03-04 11:27:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-04 11:27:50,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:50,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:27:50,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:27:50,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:50,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-04 11:27:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983229608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844568423] [2025-03-04 11:27:50,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:50,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:50,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:50,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:27:50,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:27:50,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:27:50,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:50,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:50,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:27:50,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:27:50,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:27:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844568423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:50,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:27:50,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:27:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284698714] [2025-03-04 11:27:50,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:27:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:50,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:27:50,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:27:50,403 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-03-04 11:27:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:50,435 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-03-04 11:27:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:27:50,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 26 [2025-03-04 11:27:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:50,437 INFO L225 Difference]: With dead ends: 82 [2025-03-04 11:27:50,437 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 11:27:50,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:27:50,438 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:50,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 11:27:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-03-04 11:27:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 11:27:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-04 11:27:50,453 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 26 [2025-03-04 11:27:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:50,453 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-04 11:27:50,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-03-04 11:27:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-04 11:27:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:27:50,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:50,454 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:50,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:50,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:50,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:50,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1588695901, now seen corresponding path program 1 times [2025-03-04 11:27:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840552209] [2025-03-04 11:27:50,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:50,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:27:50,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:27:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 11:27:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840552209] [2025-03-04 11:27:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840552209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613726200] [2025-03-04 11:27:50,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:50,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:50,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:27:50,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:27:50,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:27:50,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:50,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:27:50,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 11:27:50,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:27:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613726200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:51,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 11:27:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713452349] [2025-03-04 11:27:51,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:27:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:27:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:27:51,094 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 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-03-04 11:27:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:51,246 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2025-03-04 11:27:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:27:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 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 52 [2025-03-04 11:27:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:51,251 INFO L225 Difference]: With dead ends: 141 [2025-03-04 11:27:51,251 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 11:27:51,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:27:51,252 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:51,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 11:27:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-03-04 11:27:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 75 states have internal predecessors, (82), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-04 11:27:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 159 transitions. [2025-03-04 11:27:51,275 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 159 transitions. Word has length 52 [2025-03-04 11:27:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:51,275 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 159 transitions. [2025-03-04 11:27:51,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 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-03-04 11:27:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 159 transitions. [2025-03-04 11:27:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 11:27:51,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:51,281 INFO L218 NwaCegarLoop]: trace histogram [14, 11, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:27:51,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:51,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:51,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 328320629, now seen corresponding path program 1 times [2025-03-04 11:27:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223084743] [2025-03-04 11:27:51,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:51,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:27:51,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:27:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 55 proven. 155 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-04 11:27:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223084743] [2025-03-04 11:27:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223084743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958849674] [2025-03-04 11:27:51,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:51,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:51,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:51,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:51,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:27:51,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:27:51,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:27:51,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:51,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:51,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:27:51,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 309 proven. 67 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 11:27:51,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 69 proven. 202 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-04 11:27:51,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958849674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:51,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:51,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 13 [2025-03-04 11:27:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246281625] [2025-03-04 11:27:51,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:51,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:27:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:51,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:27:51,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:27:51,975 INFO L87 Difference]: Start difference. First operand 98 states and 159 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 8 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:27:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:52,091 INFO L93 Difference]: Finished difference Result 224 states and 401 transitions. [2025-03-04 11:27:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:27:52,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 8 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 124 [2025-03-04 11:27:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:52,094 INFO L225 Difference]: With dead ends: 224 [2025-03-04 11:27:52,094 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 11:27:52,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 242 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:27:52,097 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 94 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:52,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 78 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 11:27:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2025-03-04 11:27:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 84 states have internal predecessors, (93), 12 states have call successors, (12), 3 states have call predecessors, (12), 10 states have return successors, (75), 22 states have call predecessors, (75), 11 states have call successors, (75) [2025-03-04 11:27:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 180 transitions. [2025-03-04 11:27:52,110 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 180 transitions. Word has length 124 [2025-03-04 11:27:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:52,110 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 180 transitions. [2025-03-04 11:27:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 8 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:27:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 180 transitions. [2025-03-04 11:27:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 11:27:52,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:52,111 INFO L218 NwaCegarLoop]: trace histogram [19, 17, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 3, 1, 1, 1, 1, 1] [2025-03-04 11:27:52,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:52,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:52,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1686184748, now seen corresponding path program 2 times [2025-03-04 11:27:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-03-04 11:27:52,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:52,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:27:52,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:27:52,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:52,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 94 proven. 276 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2025-03-04 11:27:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-03-04 11:27:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463957828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149074294] [2025-03-04 11:27:52,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:52,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:52,485 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:52,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:27:52,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:27:52,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:27:52,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:52,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:52,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:27:52,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 445 proven. 15 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-03-04 11:27:52,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 95 proven. 325 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-03-04 11:27:52,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149074294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:52,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:52,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-04 11:27:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361088907] [2025-03-04 11:27:52,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:27:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:52,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:27:52,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:27:52,881 INFO L87 Difference]: Start difference. First operand 110 states and 180 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:27:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:52,974 INFO L93 Difference]: Finished difference Result 167 states and 276 transitions. [2025-03-04 11:27:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:27:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 174 [2025-03-04 11:27:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:52,975 INFO L225 Difference]: With dead ends: 167 [2025-03-04 11:27:52,975 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 11:27:52,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 340 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:27:52,977 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:52,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 68 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 11:27:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 11:27:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 46 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 10 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:27:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-03-04 11:27:52,981 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 174 [2025-03-04 11:27:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:52,981 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-03-04 11:27:52,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:27:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-03-04 11:27:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 11:27:52,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:52,982 INFO L218 NwaCegarLoop]: trace histogram [12, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-04 11:27:52,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:53,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash -170366185, now seen corresponding path program 3 times [2025-03-04 11:27:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:53,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268805339] [2025-03-04 11:27:53,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:53,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 10 equivalence classes. [2025-03-04 11:27:53,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 71 of 110 statements. [2025-03-04 11:27:53,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 11:27:53,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 100 proven. 25 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-04 11:27:53,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268805339] [2025-03-04 11:27:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268805339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380012279] [2025-03-04 11:27:53,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:53,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:53,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:27:53,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 10 equivalence classes. [2025-03-04 11:27:53,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 71 of 110 statements. [2025-03-04 11:27:53,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 11:27:53,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:53,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:27:53,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-04 11:27:53,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-04 11:27:53,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380012279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:53,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:53,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2025-03-04 11:27:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528526668] [2025-03-04 11:27:53,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:27:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:53,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:27:53,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:27:53,804 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:27:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:53,889 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2025-03-04 11:27:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:27:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) Word has length 110 [2025-03-04 11:27:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:53,890 INFO L225 Difference]: With dead ends: 64 [2025-03-04 11:27:53,890 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:27:53,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:27:53,891 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:53,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:27:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2025-03-04 11:27:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 8 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:27:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-04 11:27:53,895 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 110 [2025-03-04 11:27:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:53,896 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-04 11:27:53,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:27:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-04 11:27:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 11:27:53,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:53,897 INFO L218 NwaCegarLoop]: trace histogram [12, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-04 11:27:53,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:27:54,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:54,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:54,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:54,098 INFO L85 PathProgramCache]: Analyzing trace with hash -986384466, now seen corresponding path program 2 times [2025-03-04 11:27:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487822235] [2025-03-04 11:27:54,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:54,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-03-04 11:27:54,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 11:27:54,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 94 proven. 159 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-04 11:27:54,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487822235] [2025-03-04 11:27:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487822235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257065628] [2025-03-04 11:27:54,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:54,288 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:54,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:27:54,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-03-04 11:27:54,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 11:27:54,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:54,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:54,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:27:54,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 106 proven. 158 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-04 11:27:54,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 106 proven. 174 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-04 11:27:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257065628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:54,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-04 11:27:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312676280] [2025-03-04 11:27:54,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:54,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:27:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:54,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:27:54,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:27:54,872 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-04 11:27:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:55,100 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2025-03-04 11:27:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:27:55,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 13 states have call successors, (16) Word has length 111 [2025-03-04 11:27:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:55,102 INFO L225 Difference]: With dead ends: 134 [2025-03-04 11:27:55,102 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 11:27:55,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 214 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:27:55,103 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 148 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:55,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 106 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 11:27:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2025-03-04 11:27:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 57 states have internal predecessors, (64), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (17), 11 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-04 11:27:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-03-04 11:27:55,113 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 111 [2025-03-04 11:27:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-03-04 11:27:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-04 11:27:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-03-04 11:27:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 11:27:55,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:55,116 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:55,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:55,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:27:55,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 113570571, now seen corresponding path program 3 times [2025-03-04 11:27:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866025533] [2025-03-04 11:27:55,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:55,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-03-04 11:27:55,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 92 statements. [2025-03-04 11:27:55,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:55,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 101 proven. 48 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-04 11:27:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866025533] [2025-03-04 11:27:55,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866025533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648032624] [2025-03-04 11:27:55,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:55,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:55,413 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:55,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:27:55,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-03-04 11:27:55,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 92 statements. [2025-03-04 11:27:55,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:55,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:55,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:27:55,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:27:55,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 11:27:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648032624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:56,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2025-03-04 11:27:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590786970] [2025-03-04 11:27:56,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:56,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:27:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:56,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:27:56,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:27:56,196 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 11:27:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:56,839 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-03-04 11:27:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 11:27:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) Word has length 92 [2025-03-04 11:27:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:56,840 INFO L225 Difference]: With dead ends: 196 [2025-03-04 11:27:56,840 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 11:27:56,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 166 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=767, Invalid=3139, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 11:27:56,842 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:56,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 110 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:27:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 11:27:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2025-03-04 11:27:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.0375) internal successors, (83), 78 states have internal predecessors, (83), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (47), 16 states have call predecessors, (47), 10 states have call successors, (47) [2025-03-04 11:27:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-04 11:27:56,849 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 92 [2025-03-04 11:27:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-04 11:27:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 11:27:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-04 11:27:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-04 11:27:56,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:56,852 INFO L218 NwaCegarLoop]: trace histogram [40, 38, 32, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 12, 8, 1, 1, 1, 1, 1] [2025-03-04 11:27:56,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:27:57,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:57,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1304205648, now seen corresponding path program 4 times [2025-03-04 11:27:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:57,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163692536] [2025-03-04 11:27:57,058 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:27:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:57,067 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 385 statements into 2 equivalence classes. [2025-03-04 11:27:57,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 228 of 385 statements. [2025-03-04 11:27:57,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:27:57,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 455 proven. 1234 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-03-04 11:27:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163692536] [2025-03-04 11:27:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163692536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652664571] [2025-03-04 11:27:57,293 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:27:57,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:57,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:57,295 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:57,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:27:57,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 385 statements into 2 equivalence classes. [2025-03-04 11:27:57,380 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 228 of 385 statements. [2025-03-04 11:27:57,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:27:57,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:57,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:27:57,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 426 proven. 1723 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2025-03-04 11:27:57,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 426 proven. 1762 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2025-03-04 11:27:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652664571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:58,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2025-03-04 11:27:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37516144] [2025-03-04 11:27:58,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:27:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:58,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:27:58,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:27:58,504 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:27:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:58,773 INFO L93 Difference]: Finished difference Result 251 states and 397 transitions. [2025-03-04 11:27:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 11:27:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) Word has length 385 [2025-03-04 11:27:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:58,775 INFO L225 Difference]: With dead ends: 251 [2025-03-04 11:27:58,775 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:27:58,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 757 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 11:27:58,777 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 174 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:58,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 119 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:27:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2025-03-04 11:27:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 108 states have internal predecessors, (117), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (57), 23 states have call predecessors, (57), 14 states have call successors, (57) [2025-03-04 11:27:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-03-04 11:27:58,793 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 385 [2025-03-04 11:27:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-03-04 11:27:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:27:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-03-04 11:27:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-04 11:27:58,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:58,798 INFO L218 NwaCegarLoop]: trace histogram [35, 34, 28, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 11, 7, 1, 1, 1, 1, 1] [2025-03-04 11:27:58,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:27:58,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:27:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1431869370, now seen corresponding path program 5 times [2025-03-04 11:27:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484989305] [2025-03-04 11:27:58,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:27:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:59,007 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 340 statements into 27 equivalence classes. [2025-03-04 11:27:59,024 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 278 of 340 statements. [2025-03-04 11:27:59,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-04 11:27:59,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 900 proven. 837 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2025-03-04 11:27:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484989305] [2025-03-04 11:27:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484989305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791371268] [2025-03-04 11:27:59,249 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:27:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:59,251 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:59,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:27:59,300 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 340 statements into 27 equivalence classes. [2025-03-04 11:27:59,349 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 278 of 340 statements. [2025-03-04 11:27:59,349 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-04 11:27:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:59,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:27:59,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 900 proven. 837 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2025-03-04 11:27:59,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 912 proven. 872 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2025-03-04 11:28:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791371268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:00,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:00,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 23 [2025-03-04 11:28:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675293951] [2025-03-04 11:28:00,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:00,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:28:00,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:00,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:28:00,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:28:00,360 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 states have internal predecessors, (128), 14 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (26), 16 states have call predecessors, (26), 14 states have call successors, (26) [2025-03-04 11:28:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:00,767 INFO L93 Difference]: Finished difference Result 301 states and 470 transitions. [2025-03-04 11:28:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 11:28:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 states have internal predecessors, (128), 14 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (26), 16 states have call predecessors, (26), 14 states have call successors, (26) Word has length 340 [2025-03-04 11:28:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:00,770 INFO L225 Difference]: With dead ends: 301 [2025-03-04 11:28:00,772 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:28:00,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 671 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=560, Invalid=1602, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:28:00,774 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 177 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:00,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 199 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:28:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 125. [2025-03-04 11:28:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.05) internal successors, (105), 99 states have internal predecessors, (105), 16 states have call successors, (16), 12 states have call predecessors, (16), 8 states have return successors, (37), 13 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-04 11:28:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 158 transitions. [2025-03-04 11:28:00,786 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 158 transitions. Word has length 340 [2025-03-04 11:28:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:00,786 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 158 transitions. [2025-03-04 11:28:00,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 states have internal predecessors, (128), 14 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (26), 16 states have call predecessors, (26), 14 states have call successors, (26) [2025-03-04 11:28:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 158 transitions. [2025-03-04 11:28:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-04 11:28:00,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:00,800 INFO L218 NwaCegarLoop]: trace histogram [35, 34, 28, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 11, 7, 1, 1, 1, 1, 1] [2025-03-04 11:28:00,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:28:01,002 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:01,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1953340652, now seen corresponding path program 6 times [2025-03-04 11:28:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784192011] [2025-03-04 11:28:01,003 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:01,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:01,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 340 statements into 24 equivalence classes. [2025-03-04 11:28:01,038 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) and asserted 320 of 340 statements. [2025-03-04 11:28:01,038 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2025-03-04 11:28:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 1065 proven. 374 refuted. 0 times theorem prover too weak. 2611 trivial. 0 not checked. [2025-03-04 11:28:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784192011] [2025-03-04 11:28:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784192011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446330740] [2025-03-04 11:28:01,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:01,326 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:01,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:28:01,384 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 340 statements into 24 equivalence classes. [2025-03-04 11:28:01,445 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) and asserted 320 of 340 statements. [2025-03-04 11:28:01,445 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2025-03-04 11:28:01,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:01,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:28:01,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 1131 proven. 417 refuted. 0 times theorem prover too weak. 2502 trivial. 0 not checked. [2025-03-04 11:28:01,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 1135 proven. 447 refuted. 0 times theorem prover too weak. 2468 trivial. 0 not checked. [2025-03-04 11:28:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446330740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:02,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:02,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 17] total 24 [2025-03-04 11:28:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890635203] [2025-03-04 11:28:02,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:02,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:02,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:02,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:02,259 INFO L87 Difference]: Start difference. First operand 125 states and 158 transitions. Second operand has 24 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 11:28:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:02,459 INFO L93 Difference]: Finished difference Result 263 states and 335 transitions. [2025-03-04 11:28:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:28:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) Word has length 340 [2025-03-04 11:28:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:02,464 INFO L225 Difference]: With dead ends: 263 [2025-03-04 11:28:02,465 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 11:28:02,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 666 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:02,466 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 108 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 161 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 11:28:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2025-03-04 11:28:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 104 states have internal predecessors, (110), 17 states have call successors, (17), 13 states have call predecessors, (17), 8 states have return successors, (33), 13 states have call predecessors, (33), 16 states have call successors, (33) [2025-03-04 11:28:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2025-03-04 11:28:02,475 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 340 [2025-03-04 11:28:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2025-03-04 11:28:02,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 11:28:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2025-03-04 11:28:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 11:28:02,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:02,480 INFO L218 NwaCegarLoop]: trace histogram [42, 40, 34, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1, 1] [2025-03-04 11:28:02,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:02,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:28:02,681 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1282103478, now seen corresponding path program 7 times [2025-03-04 11:28:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-03-04 11:28:02,681 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:02,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 11:28:02,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 11:28:02,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:02,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 830 proven. 1470 refuted. 0 times theorem prover too weak. 3503 trivial. 0 not checked. [2025-03-04 11:28:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-03-04 11:28:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011782866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27072618] [2025-03-04 11:28:04,117 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:04,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:04,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:04,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:04,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:28:04,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 11:28:04,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 11:28:04,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:04,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:04,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 11:28:04,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3871 trivial. 0 not checked. [2025-03-04 11:28:04,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3639 trivial. 0 not checked. [2025-03-04 11:28:09,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27072618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:09,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:09,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 45 [2025-03-04 11:28:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955481987] [2025-03-04 11:28:09,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:09,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 11:28:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:09,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 11:28:09,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:28:09,235 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-04 11:28:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:09,382 INFO L93 Difference]: Finished difference Result 162 states and 212 transitions. [2025-03-04 11:28:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:28:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) Word has length 405 [2025-03-04 11:28:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:09,385 INFO L225 Difference]: With dead ends: 162 [2025-03-04 11:28:09,385 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 11:28:09,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 794 SyntacticMatches, 51 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2454 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=544, Invalid=1906, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:28:09,386 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:09,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 198 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 11:28:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2025-03-04 11:28:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 122 states have (on average 1.040983606557377) internal successors, (127), 120 states have internal predecessors, (127), 19 states have call successors, (19), 13 states have call predecessors, (19), 10 states have return successors, (51), 18 states have call predecessors, (51), 18 states have call successors, (51) [2025-03-04 11:28:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2025-03-04 11:28:09,396 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 405 [2025-03-04 11:28:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:09,397 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2025-03-04 11:28:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-04 11:28:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2025-03-04 11:28:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-04 11:28:09,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:09,401 INFO L218 NwaCegarLoop]: trace histogram [84, 82, 68, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-03-04 11:28:09,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:09,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:28:09,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:09,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash -291664816, now seen corresponding path program 8 times [2025-03-04 11:28:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390173203] [2025-03-04 11:28:09,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:09,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 817 statements into 2 equivalence classes. [2025-03-04 11:28:09,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 817 of 817 statements. [2025-03-04 11:28:09,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:09,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2315 proven. 5134 refuted. 0 times theorem prover too weak. 16766 trivial. 0 not checked. [2025-03-04 11:28:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390173203] [2025-03-04 11:28:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390173203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851542939] [2025-03-04 11:28:10,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:10,546 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:10,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:28:10,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 817 statements into 2 equivalence classes. [2025-03-04 11:28:10,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 817 of 817 statements. [2025-03-04 11:28:10,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:10,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:28:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2709 proven. 5499 refuted. 0 times theorem prover too weak. 16007 trivial. 0 not checked. [2025-03-04 11:28:10,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2709 proven. 5667 refuted. 0 times theorem prover too weak. 15839 trivial. 0 not checked. [2025-03-04 11:28:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851542939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:13,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-04 11:28:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928346668] [2025-03-04 11:28:13,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:13,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:28:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:13,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:28:13,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:13,466 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 11:28:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:13,955 INFO L93 Difference]: Finished difference Result 374 states and 542 transitions. [2025-03-04 11:28:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 11:28:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) Word has length 817 [2025-03-04 11:28:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:13,958 INFO L225 Difference]: With dead ends: 374 [2025-03-04 11:28:13,958 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 11:28:13,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1695 GetRequests, 1615 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1076, Invalid=3346, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 11:28:13,964 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 490 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:13,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 215 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 11:28:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 185. [2025-03-04 11:28:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 146 states have internal predecessors, (155), 23 states have call successors, (23), 17 states have call predecessors, (23), 11 states have return successors, (64), 21 states have call predecessors, (64), 22 states have call successors, (64) [2025-03-04 11:28:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 242 transitions. [2025-03-04 11:28:13,976 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 242 transitions. Word has length 817 [2025-03-04 11:28:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:13,977 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 242 transitions. [2025-03-04 11:28:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 11:28:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2025-03-04 11:28:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2025-03-04 11:28:13,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:13,981 INFO L218 NwaCegarLoop]: trace histogram [83, 82, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-03-04 11:28:13,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:28:14,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:14,182 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1544852861, now seen corresponding path program 9 times [2025-03-04 11:28:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214203389] [2025-03-04 11:28:14,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:14,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 811 statements into 60 equivalence classes. [2025-03-04 11:28:14,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) and asserted 600 of 811 statements. [2025-03-04 11:28:14,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2025-03-04 11:28:14,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 3562 proven. 2169 refuted. 0 times theorem prover too weak. 18128 trivial. 0 not checked. [2025-03-04 11:28:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214203389] [2025-03-04 11:28:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214203389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650358643] [2025-03-04 11:28:14,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:14,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:14,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:14,733 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:14,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:28:14,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 811 statements into 60 equivalence classes. [2025-03-04 11:28:15,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) and asserted 600 of 811 statements. [2025-03-04 11:28:15,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2025-03-04 11:28:15,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:15,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:28:15,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 3424 proven. 1968 refuted. 0 times theorem prover too weak. 18467 trivial. 0 not checked. [2025-03-04 11:28:15,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 3444 proven. 2023 refuted. 0 times theorem prover too weak. 18392 trivial. 0 not checked. [2025-03-04 11:28:16,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650358643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:16,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:16,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 21] total 27 [2025-03-04 11:28:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657831061] [2025-03-04 11:28:16,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:16,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:28:16,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:16,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:28:16,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:28:16,480 INFO L87 Difference]: Start difference. First operand 185 states and 242 transitions. Second operand has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 15 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (31), 19 states have call predecessors, (31), 15 states have call successors, (31) [2025-03-04 11:28:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:16,806 INFO L93 Difference]: Finished difference Result 457 states and 595 transitions. [2025-03-04 11:28:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 11:28:16,807 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 15 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (31), 19 states have call predecessors, (31), 15 states have call successors, (31) Word has length 811 [2025-03-04 11:28:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:16,809 INFO L225 Difference]: With dead ends: 457 [2025-03-04 11:28:16,809 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 11:28:16,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1609 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=571, Invalid=1685, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:16,811 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 154 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 184 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 11:28:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 169. [2025-03-04 11:28:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 134 states have internal predecessors, (141), 21 states have call successors, (21), 17 states have call predecessors, (21), 10 states have return successors, (43), 17 states have call predecessors, (43), 20 states have call successors, (43) [2025-03-04 11:28:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 205 transitions. [2025-03-04 11:28:16,826 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 205 transitions. Word has length 811 [2025-03-04 11:28:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:16,828 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 205 transitions. [2025-03-04 11:28:16,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 15 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (31), 19 states have call predecessors, (31), 15 states have call successors, (31) [2025-03-04 11:28:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 205 transitions. [2025-03-04 11:28:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1747 [2025-03-04 11:28:16,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:16,841 INFO L218 NwaCegarLoop]: trace histogram [180, 175, 146, 91, 91, 91, 91, 88, 88, 88, 88, 88, 87, 87, 87, 86, 55, 34, 1, 1, 1, 1, 1] [2025-03-04 11:28:16,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:28:17,044 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2069104803, now seen corresponding path program 10 times [2025-03-04 11:28:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637246064] [2025-03-04 11:28:17,045 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:17,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1746 statements into 2 equivalence classes. [2025-03-04 11:28:17,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1036 of 1746 statements. [2025-03-04 11:28:17,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 112075 backedges. 3996 proven. 13668 refuted. 0 times theorem prover too weak. 94411 trivial. 0 not checked. [2025-03-04 11:28:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637246064] [2025-03-04 11:28:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637246064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954846614] [2025-03-04 11:28:18,252 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:18,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:18,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:18,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:18,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:28:18,442 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1746 statements into 2 equivalence classes. [2025-03-04 11:28:18,584 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1036 of 1746 statements. [2025-03-04 11:28:18,585 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:18,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 2166 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 11:28:18,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 112075 backedges. 44491 proven. 10618 refuted. 0 times theorem prover too weak. 56966 trivial. 0 not checked. [2025-03-04 11:28:18,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 112075 backedges. 4856 proven. 15687 refuted. 0 times theorem prover too weak. 91532 trivial. 0 not checked. [2025-03-04 11:28:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954846614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:22,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 31] total 36 [2025-03-04 11:28:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643695122] [2025-03-04 11:28:22,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:28:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:22,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:28:22,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:22,016 INFO L87 Difference]: Start difference. First operand 169 states and 205 transitions. Second operand has 36 states, 36 states have (on average 5.944444444444445) internal successors, (214), 36 states have internal predecessors, (214), 31 states have call successors, (38), 6 states have call predecessors, (38), 14 states have return successors, (43), 16 states have call predecessors, (43), 27 states have call successors, (43) [2025-03-04 11:28:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:22,565 INFO L93 Difference]: Finished difference Result 392 states and 518 transitions. [2025-03-04 11:28:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 11:28:22,565 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.944444444444445) internal successors, (214), 36 states have internal predecessors, (214), 31 states have call successors, (38), 6 states have call predecessors, (38), 14 states have return successors, (43), 16 states have call predecessors, (43), 27 states have call successors, (43) Word has length 1746 [2025-03-04 11:28:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:22,568 INFO L225 Difference]: With dead ends: 392 [2025-03-04 11:28:22,568 INFO L226 Difference]: Without dead ends: 229 [2025-03-04 11:28:22,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3561 GetRequests, 3470 SyntacticMatches, 21 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1309, Invalid=3803, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 11:28:22,571 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 550 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:22,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 195 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-04 11:28:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2025-03-04 11:28:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 166 states have (on average 1.0301204819277108) internal successors, (171), 164 states have internal predecessors, (171), 27 states have call successors, (27), 22 states have call predecessors, (27), 11 states have return successors, (54), 18 states have call predecessors, (54), 26 states have call successors, (54) [2025-03-04 11:28:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2025-03-04 11:28:22,583 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 1746 [2025-03-04 11:28:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:22,584 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2025-03-04 11:28:22,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.944444444444445) internal successors, (214), 36 states have internal predecessors, (214), 31 states have call successors, (38), 6 states have call predecessors, (38), 14 states have return successors, (43), 16 states have call predecessors, (43), 27 states have call successors, (43) [2025-03-04 11:28:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2025-03-04 11:28:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-04 11:28:22,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:22,590 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, 1] [2025-03-04 11:28:22,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:28:22,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:22,791 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1653235746, now seen corresponding path program 11 times [2025-03-04 11:28:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378502304] [2025-03-04 11:28:22,792 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:22,807 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1066 statements into 83 equivalence classes. [2025-03-04 11:28:22,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-04 11:28:22,903 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2025-03-04 11:28:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 8043 proven. 9750 refuted. 0 times theorem prover too weak. 23673 trivial. 0 not checked. [2025-03-04 11:28:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378502304] [2025-03-04 11:28:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378502304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096820204] [2025-03-04 11:28:35,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:35,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,658 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:28:35,846 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1066 statements into 83 equivalence classes. [2025-03-04 11:28:36,080 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-04 11:28:36,080 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2025-03-04 11:28:36,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:36,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1989 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-04 11:28:36,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-03-04 11:28:36,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2025-03-04 11:29:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096820204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:08,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 41] total 61 [2025-03-04 11:29:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670324532] [2025-03-04 11:29:08,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 11:29:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 11:29:08,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=2929, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:29:08,648 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand has 62 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 62 states have internal predecessors, (159), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (43), 43 states have call predecessors, (43), 16 states have call successors, (43) [2025-03-04 11:29:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,808 INFO L93 Difference]: Finished difference Result 236 states and 308 transitions. [2025-03-04 11:29:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 11:29:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 62 states have internal predecessors, (159), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (43), 43 states have call predecessors, (43), 16 states have call successors, (43) Word has length 1066 [2025-03-04 11:29:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,811 INFO L225 Difference]: With dead ends: 236 [2025-03-04 11:29:08,811 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 11:29:08,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2351 GetRequests, 2095 SyntacticMatches, 192 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=960, Invalid=3330, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 11:29:08,812 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 209 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 11:29:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 226. [2025-03-04 11:29:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 180 states have internal predecessors, (188), 29 states have call successors, (29), 22 states have call predecessors, (29), 13 states have return successors, (76), 23 states have call predecessors, (76), 28 states have call successors, (76) [2025-03-04 11:29:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 293 transitions. [2025-03-04 11:29:08,823 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 293 transitions. Word has length 1066 [2025-03-04 11:29:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,824 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 293 transitions. [2025-03-04 11:29:08,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 62 states have internal predecessors, (159), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (43), 43 states have call predecessors, (43), 16 states have call successors, (43) [2025-03-04 11:29:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 293 transitions. [2025-03-04 11:29:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3244 [2025-03-04 11:29:08,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,861 INFO L218 NwaCegarLoop]: trace histogram [333, 327, 270, 168, 168, 168, 168, 164, 164, 164, 164, 164, 163, 163, 163, 162, 102, 63, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:29:09,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:09,062 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 129272665, now seen corresponding path program 12 times [2025-03-04 11:29:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303987029] [2025-03-04 11:29:09,063 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:29:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:09,105 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3243 statements into 222 equivalence classes. [2025-03-04 11:29:09,329 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) and asserted 1876 of 3243 statements. [2025-03-04 11:29:09,329 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) [2025-03-04 11:29:09,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 388630 backedges. 13421 proven. 34623 refuted. 0 times theorem prover too weak. 340586 trivial. 0 not checked. [2025-03-04 11:29:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303987029] [2025-03-04 11:29:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303987029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176159249] [2025-03-04 11:29:13,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:29:13,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:13,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:13,264 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:13,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:29:13,771 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3243 statements into 222 equivalence classes. [2025-03-04 11:29:14,395 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) and asserted 1876 of 3243 statements. [2025-03-04 11:29:14,395 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 126 check-sat command(s) [2025-03-04 11:29:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:14,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 3471 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 11:29:14,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 388630 backedges. 182987 proven. 16490 refuted. 0 times theorem prover too weak. 189153 trivial. 0 not checked. [2025-03-04 11:29:14,646 INFO L312 TraceCheckSpWp]: Computing backward predicates...