./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:12:28,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:12:28,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:12:28,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:12:28,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:12:28,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:12:28,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:12:28,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:12:28,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:12:28,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:12:28,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:12:28,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:12:28,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:12:28,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:12:28,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:12:28,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:12:28,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:12:28,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:12:28,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:12:28,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:12:28,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:12:28,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:12:28,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:12:28,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:12:28,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:12:28,161 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:12:28,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:12:28,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:12:28,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:12:28,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:12:28,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:12:28,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:12:28,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:12:28,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:12:28,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:12:28,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:12:28,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:12:28,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:12:28,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:12:28,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:12:28,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:12:28,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:12:28,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:12:28,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:12:28,166 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2024-10-11 21:12:28,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:12:28,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:12:28,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:12:28,411 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:12:28,412 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:12:28,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2024-10-11 21:12:29,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:12:29,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:12:29,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2024-10-11 21:12:29,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f9973aec/8f1dec00f477476ba31db6cbe93e4fa0/FLAG0afbd01e4 [2024-10-11 21:12:29,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f9973aec/8f1dec00f477476ba31db6cbe93e4fa0 [2024-10-11 21:12:29,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:12:29,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:12:29,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:12:29,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:12:29,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:12:29,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:12:29" (1/1) ... [2024-10-11 21:12:29,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6932c770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:29, skipping insertion in model container [2024-10-11 21:12:29,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:12:29" (1/1) ... [2024-10-11 21:12:29,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:12:30,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:12:30,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:12:30,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:12:30,120 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:12:30,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30 WrapperNode [2024-10-11 21:12:30,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:12:30,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:12:30,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:12:30,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:12:30,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,157 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2024-10-11 21:12:30,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:12:30,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:12:30,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:12:30,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:12:30,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,176 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]. [2024-10-11 21:12:30,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:12:30,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:12:30,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:12:30,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:12:30,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (1/1) ... [2024-10-11 21:12:30,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:12:30,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:30,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:12:30,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:12:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-10-11 21:12:30,254 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-10-11 21:12:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:12:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:12:30,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:12:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:12:30,306 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:12:30,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:12:30,411 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 21:12:30,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:12:30,457 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:12:30,458 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:12:30,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:12:30 BoogieIcfgContainer [2024-10-11 21:12:30,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:12:30,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:12:30,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:12:30,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:12:30,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:12:29" (1/3) ... [2024-10-11 21:12:30,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a9734e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:12:30, skipping insertion in model container [2024-10-11 21:12:30,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:30" (2/3) ... [2024-10-11 21:12:30,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a9734e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:12:30, skipping insertion in model container [2024-10-11 21:12:30,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:12:30" (3/3) ... [2024-10-11 21:12:30,471 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2024-10-11 21:12:30,485 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:12:30,485 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 21:12:30,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:12:30,541 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;@344fa02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:12:30,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 21:12:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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) [2024-10-11 21:12:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:12:30,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:30,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:12:30,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:30,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1932596477, now seen corresponding path program 1 times [2024-10-11 21:12:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:30,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944467832] [2024-10-11 21:12:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:12:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944467832] [2024-10-11 21:12:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944467832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:12:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:12:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:12:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631853725] [2024-10-11 21:12:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:12:30,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:12:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:12:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:12:30,773 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-10-11 21:12:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:30,818 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-11 21:12:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:12:30,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-11 21:12:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:30,827 INFO L225 Difference]: With dead ends: 31 [2024-10-11 21:12:30,827 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 21:12:30,830 INFO L431 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 [2024-10-11 21:12:30,832 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:30,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 21:12:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-11 21:12:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.4615384615384615) 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) [2024-10-11 21:12:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-11 21:12:30,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2024-10-11 21:12:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:30,862 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-11 21:12:30,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-10-11 21:12:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-11 21:12:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 21:12:30,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:30,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:30,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:12:30,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:30,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 219051399, now seen corresponding path program 1 times [2024-10-11 21:12:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:30,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400863945] [2024-10-11 21:12:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:12:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400863945] [2024-10-11 21:12:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400863945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:12:30,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:12:30,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:12:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732244963] [2024-10-11 21:12:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:12:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:12:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:30,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:12:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:12:30,928 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:12:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:31,008 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-11 21:12:31,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:12:31,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 21:12:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:31,010 INFO L225 Difference]: With dead ends: 23 [2024-10-11 21:12:31,010 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 21:12:31,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:12:31,011 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:31,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 21:12:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-11 21:12:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 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) [2024-10-11 21:12:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-11 21:12:31,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2024-10-11 21:12:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-11 21:12:31,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:12:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-11 21:12:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 21:12:31,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:31,019 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:12:31,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1794218543, now seen corresponding path program 1 times [2024-10-11 21:12:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939639629] [2024-10-11 21:12:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:12:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:12:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:12:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939639629] [2024-10-11 21:12:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939639629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:12:31,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:12:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:12:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848420630] [2024-10-11 21:12:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:12:31,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:12:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:31,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:12:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:12:31,242 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-10-11 21:12:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:31,293 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 21:12:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:12:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 22 [2024-10-11 21:12:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:31,295 INFO L225 Difference]: With dead ends: 33 [2024-10-11 21:12:31,295 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 21:12:31,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:12:31,296 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:31,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 21:12:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-11 21:12:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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) [2024-10-11 21:12:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 21:12:31,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2024-10-11 21:12:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:31,311 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 21:12:31,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-10-11 21:12:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 21:12:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 21:12:31,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:31,313 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:31,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:12:31,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 605645438, now seen corresponding path program 1 times [2024-10-11 21:12:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469391370] [2024-10-11 21:12:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:12:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 21:12:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:12:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469391370] [2024-10-11 21:12:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469391370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573695453] [2024-10-11 21:12:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:31,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:31,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:12:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:31,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:12:31,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:12:31,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:12:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573695453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:31,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-10-11 21:12:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043517561] [2024-10-11 21:12:31,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:31,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 21:12:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 21:12:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:12:31,832 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:12:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:32,346 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2024-10-11 21:12:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:12:32,348 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-10-11 21:12:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:32,351 INFO L225 Difference]: With dead ends: 177 [2024-10-11 21:12:32,351 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 21:12:32,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:12:32,356 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 154 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:32,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 301 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:12:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 21:12:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2024-10-11 21:12:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (46), 21 states have call predecessors, (46), 16 states have call successors, (46) [2024-10-11 21:12:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2024-10-11 21:12:32,379 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 29 [2024-10-11 21:12:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:32,379 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2024-10-11 21:12:32,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:12:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2024-10-11 21:12:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 21:12:32,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:32,381 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:32,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:12:32,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:32,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:32,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1969889286, now seen corresponding path program 2 times [2024-10-11 21:12:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:32,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925717701] [2024-10-11 21:12:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:12:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:12:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:12:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925717701] [2024-10-11 21:12:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925717701] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638487659] [2024-10-11 21:12:32,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:12:32,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:32,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:32,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:32,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:12:32,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:12:32,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:12:32,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:12:32,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:12:32,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:12:32,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638487659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:12:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:12:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 21:12:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322920492] [2024-10-11 21:12:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:12:32,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:12:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:12:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:12:32,817 INFO L87 Difference]: Start difference. First operand 128 states and 173 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:12:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:32,851 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2024-10-11 21:12:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:12:32,852 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-10-11 21:12:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:32,856 INFO L225 Difference]: With dead ends: 151 [2024-10-11 21:12:32,857 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 21:12:32,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:12:32,858 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:32,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 21:12:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2024-10-11 21:12:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 106 states have internal predecessors, (117), 17 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (55), 24 states have call predecessors, (55), 16 states have call successors, (55) [2024-10-11 21:12:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-11 21:12:32,882 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 41 [2024-10-11 21:12:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:32,882 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-11 21:12:32,883 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:12:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-11 21:12:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 21:12:32,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:32,886 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:32,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 21:12:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:33,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -937025668, now seen corresponding path program 1 times [2024-10-11 21:12:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559415197] [2024-10-11 21:12:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:12:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:12:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:12:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559415197] [2024-10-11 21:12:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559415197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67113595] [2024-10-11 21:12:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:33,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:33,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:33,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:33,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:12:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:33,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 21:12:33,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:12:33,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:12:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67113595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:33,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:33,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2024-10-11 21:12:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700588544] [2024-10-11 21:12:33,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:33,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 21:12:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 21:12:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-10-11 21:12:33,575 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 12 states have call successors, (15), 9 states have call predecessors, (15), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:12:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:34,463 INFO L93 Difference]: Finished difference Result 425 states and 669 transitions. [2024-10-11 21:12:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 21:12:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 12 states have call successors, (15), 9 states have call predecessors, (15), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-10-11 21:12:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:34,467 INFO L225 Difference]: With dead ends: 425 [2024-10-11 21:12:34,469 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 21:12:34,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 21:12:34,476 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 224 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:34,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 517 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:12:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 21:12:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2024-10-11 21:12:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 212 states have (on average 1.099056603773585) internal successors, (233), 212 states have internal predecessors, (233), 34 states have call successors, (34), 10 states have call predecessors, (34), 22 states have return successors, (103), 47 states have call predecessors, (103), 33 states have call successors, (103) [2024-10-11 21:12:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 370 transitions. [2024-10-11 21:12:34,513 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 370 transitions. Word has length 42 [2024-10-11 21:12:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:34,513 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 370 transitions. [2024-10-11 21:12:34,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 12 states have call successors, (15), 9 states have call predecessors, (15), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:12:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2024-10-11 21:12:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 21:12:34,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:34,515 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:34,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:12:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:34,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:34,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1677645046, now seen corresponding path program 1 times [2024-10-11 21:12:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404104874] [2024-10-11 21:12:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:12:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:34,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:12:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-11 21:12:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404104874] [2024-10-11 21:12:34,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404104874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:12:34,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:12:34,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:12:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180727275] [2024-10-11 21:12:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:12:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:12:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:12:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:12:34,829 INFO L87 Difference]: Start difference. First operand 270 states and 370 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:12:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:34,868 INFO L93 Difference]: Finished difference Result 284 states and 392 transitions. [2024-10-11 21:12:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:12:34,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2024-10-11 21:12:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:34,871 INFO L225 Difference]: With dead ends: 284 [2024-10-11 21:12:34,871 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 21:12:34,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:12:34,872 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:34,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 21:12:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2024-10-11 21:12:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 218 states have (on average 1.0963302752293578) internal successors, (239), 217 states have internal predecessors, (239), 35 states have call successors, (35), 10 states have call predecessors, (35), 22 states have return successors, (109), 49 states have call predecessors, (109), 34 states have call successors, (109) [2024-10-11 21:12:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 383 transitions. [2024-10-11 21:12:34,908 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 383 transitions. Word has length 67 [2024-10-11 21:12:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:34,908 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 383 transitions. [2024-10-11 21:12:34,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:12:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 383 transitions. [2024-10-11 21:12:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 21:12:34,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:34,914 INFO L215 NwaCegarLoop]: trace histogram [14, 12, 10, 10, 10, 10, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:12:34,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:12:34,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:34,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1513325295, now seen corresponding path program 1 times [2024-10-11 21:12:34,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:34,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283885246] [2024-10-11 21:12:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:12:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 21:12:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 21:12:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:35,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:35,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-11 21:12:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283885246] [2024-10-11 21:12:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283885246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115766642] [2024-10-11 21:12:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:35,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:35,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:35,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:12:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:35,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 21:12:35,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 178 proven. 184 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 21:12:35,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 52 proven. 330 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 21:12:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115766642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:35,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 25 [2024-10-11 21:12:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378505587] [2024-10-11 21:12:35,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:35,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 21:12:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 21:12:35,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-10-11 21:12:35,645 INFO L87 Difference]: Start difference. First operand 277 states and 383 transitions. Second operand has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 17 states have internal predecessors, (83), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 21:12:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:36,153 INFO L93 Difference]: Finished difference Result 602 states and 876 transitions. [2024-10-11 21:12:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 21:12:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 17 states have internal predecessors, (83), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 99 [2024-10-11 21:12:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:36,156 INFO L225 Difference]: With dead ends: 602 [2024-10-11 21:12:36,157 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 21:12:36,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 18 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 21:12:36,160 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 300 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:36,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 462 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:12:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 21:12:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 307. [2024-10-11 21:12:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 242 states have (on average 1.0950413223140496) internal successors, (265), 240 states have internal predecessors, (265), 39 states have call successors, (39), 11 states have call predecessors, (39), 24 states have return successors, (124), 55 states have call predecessors, (124), 38 states have call successors, (124) [2024-10-11 21:12:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 428 transitions. [2024-10-11 21:12:36,182 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 428 transitions. Word has length 99 [2024-10-11 21:12:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:36,182 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 428 transitions. [2024-10-11 21:12:36,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 17 states have internal predecessors, (83), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 21:12:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 428 transitions. [2024-10-11 21:12:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:12:36,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:36,188 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 21:12:36,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:12:36,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 21:12:36,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:36,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash -736975495, now seen corresponding path program 2 times [2024-10-11 21:12:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911240941] [2024-10-11 21:12:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:36,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:12:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:12:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:12:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-11 21:12:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911240941] [2024-10-11 21:12:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911240941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459506092] [2024-10-11 21:12:36,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:12:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:36,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:36,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:12:36,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:12:36,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:12:36,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:12:36,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-11 21:12:36,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-11 21:12:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459506092] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:36,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-11 21:12:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873276538] [2024-10-11 21:12:36,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 21:12:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 21:12:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:12:36,620 INFO L87 Difference]: Start difference. First operand 307 states and 428 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:12:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:36,676 INFO L93 Difference]: Finished difference Result 328 states and 453 transitions. [2024-10-11 21:12:36,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:12:36,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2024-10-11 21:12:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:36,679 INFO L225 Difference]: With dead ends: 328 [2024-10-11 21:12:36,679 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 21:12:36,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:12:36,680 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:36,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 21:12:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 307. [2024-10-11 21:12:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 242 states have (on average 1.0950413223140496) internal successors, (265), 240 states have internal predecessors, (265), 39 states have call successors, (39), 11 states have call predecessors, (39), 24 states have return successors, (124), 55 states have call predecessors, (124), 38 states have call successors, (124) [2024-10-11 21:12:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 428 transitions. [2024-10-11 21:12:36,704 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 428 transitions. Word has length 85 [2024-10-11 21:12:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:36,705 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 428 transitions. [2024-10-11 21:12:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:12:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 428 transitions. [2024-10-11 21:12:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 21:12:36,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:36,707 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:12:36,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:12:36,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:36,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1371403811, now seen corresponding path program 1 times [2024-10-11 21:12:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515496425] [2024-10-11 21:12:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:12:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:12:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:37,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:12:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 183 proven. 116 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 21:12:37,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:37,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515496425] [2024-10-11 21:12:37,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515496425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:37,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55666817] [2024-10-11 21:12:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:37,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:37,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:37,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:12:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:37,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 21:12:37,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:12:37,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:12:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55666817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:37,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 26 [2024-10-11 21:12:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998363785] [2024-10-11 21:12:37,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 21:12:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:37,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 21:12:37,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2024-10-11 21:12:37,666 INFO L87 Difference]: Start difference. First operand 307 states and 428 transitions. Second operand has 26 states, 25 states have (on average 3.12) internal successors, (78), 18 states have internal predecessors, (78), 12 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 21:12:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:38,254 INFO L93 Difference]: Finished difference Result 489 states and 683 transitions. [2024-10-11 21:12:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-11 21:12:38,254 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.12) internal successors, (78), 18 states have internal predecessors, (78), 12 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 86 [2024-10-11 21:12:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:38,256 INFO L225 Difference]: With dead ends: 489 [2024-10-11 21:12:38,256 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 21:12:38,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 166 SyntacticMatches, 18 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=825, Invalid=2367, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 21:12:38,260 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 523 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:38,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 144 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:12:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 21:12:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2024-10-11 21:12:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 129 states have internal predecessors, (146), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:12:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2024-10-11 21:12:38,269 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 187 transitions. Word has length 86 [2024-10-11 21:12:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:38,269 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 187 transitions. [2024-10-11 21:12:38,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.12) internal successors, (78), 18 states have internal predecessors, (78), 12 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 21:12:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2024-10-11 21:12:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 21:12:38,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:38,270 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:12:38,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:12:38,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 21:12:38,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:38,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1334176510, now seen corresponding path program 2 times [2024-10-11 21:12:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:38,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835225111] [2024-10-11 21:12:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:38,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 21:12:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 21:12:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 21:12:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835225111] [2024-10-11 21:12:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835225111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784825499] [2024-10-11 21:12:38,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:12:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:38,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:38,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:12:38,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:12:38,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:12:38,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:12:38,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-10-11 21:12:38,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 21:12:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784825499] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:38,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:38,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-10-11 21:12:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200219891] [2024-10-11 21:12:38,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:38,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 21:12:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 21:12:38,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 21:12:38,916 INFO L87 Difference]: Start difference. First operand 163 states and 187 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:12:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:38,985 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2024-10-11 21:12:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 21:12:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2024-10-11 21:12:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:38,989 INFO L225 Difference]: With dead ends: 164 [2024-10-11 21:12:38,989 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 21:12:38,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:12:38,990 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:38,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 21:12:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-11 21:12:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 129 states have internal predecessors, (144), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:12:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2024-10-11 21:12:39,002 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 185 transitions. Word has length 80 [2024-10-11 21:12:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:39,002 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 185 transitions. [2024-10-11 21:12:39,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:12:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 185 transitions. [2024-10-11 21:12:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:12:39,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:39,004 INFO L215 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2024-10-11 21:12:39,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:12:39,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:39,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -40645547, now seen corresponding path program 3 times [2024-10-11 21:12:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467687682] [2024-10-11 21:12:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:12:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:12:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-11 21:12:39,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:39,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467687682] [2024-10-11 21:12:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467687682] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384464613] [2024-10-11 21:12:39,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:12:39,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:39,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:39,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:12:39,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 21:12:39,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:12:39,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:12:39,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-10-11 21:12:39,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-10-11 21:12:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384464613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:39,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-10-11 21:12:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765899476] [2024-10-11 21:12:39,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:39,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 21:12:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 21:12:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:12:39,730 INFO L87 Difference]: Start difference. First operand 163 states and 185 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 21:12:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:39,800 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2024-10-11 21:12:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:12:39,801 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 112 [2024-10-11 21:12:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:39,802 INFO L225 Difference]: With dead ends: 163 [2024-10-11 21:12:39,802 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 21:12:39,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 237 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:12:39,803 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:39,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:12:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 21:12:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 21:12:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.054263565891473) internal successors, (136), 128 states have internal predecessors, (136), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:12:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2024-10-11 21:12:39,811 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 112 [2024-10-11 21:12:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:39,812 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2024-10-11 21:12:39,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 21:12:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2024-10-11 21:12:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 21:12:39,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:39,815 INFO L215 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1] [2024-10-11 21:12:39,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:12:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:12:40,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 767646059, now seen corresponding path program 3 times [2024-10-11 21:12:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749167192] [2024-10-11 21:12:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 21:12:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:12:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 21:12:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-10-11 21:12:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749167192] [2024-10-11 21:12:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749167192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814267958] [2024-10-11 21:12:40,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:12:40,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:40,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:40,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:12:40,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 21:12:40,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:12:40,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 21:12:40,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-10-11 21:12:40,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 21:12:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814267958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:41,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:41,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2024-10-11 21:12:41,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292294587] [2024-10-11 21:12:41,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:41,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 21:12:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 21:12:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:12:41,828 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 21:12:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:41,899 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2024-10-11 21:12:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 21:12:41,899 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 166 [2024-10-11 21:12:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:41,900 INFO L225 Difference]: With dead ends: 163 [2024-10-11 21:12:41,900 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 21:12:41,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2024-10-11 21:12:41,901 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:41,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:12:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 21:12:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 21:12:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.0232558139534884) internal successors, (132), 128 states have internal predecessors, (132), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:12:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2024-10-11 21:12:41,909 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 166 [2024-10-11 21:12:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:41,910 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2024-10-11 21:12:41,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 21:12:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2024-10-11 21:12:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-11 21:12:41,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:41,914 INFO L215 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1] [2024-10-11 21:12:41,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 21:12:42,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:42,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2100659218, now seen corresponding path program 4 times [2024-10-11 21:12:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572625045] [2024-10-11 21:12:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 21:12:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:12:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:12:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:12:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:12:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 21:12:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:12:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:12:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:12:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:12:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2024-10-11 21:12:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:12:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572625045] [2024-10-11 21:12:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572625045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:12:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079490701] [2024-10-11 21:12:44,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 21:12:44,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:12:44,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:12:44,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:12:44,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:12:44,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 21:12:44,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:12:44,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-11 21:12:44,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:12:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2024-10-11 21:12:45,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:12:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2024-10-11 21:12:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079490701] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:12:50,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:12:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2024-10-11 21:12:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996956092] [2024-10-11 21:12:50,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:12:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 21:12:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:12:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 21:12:50,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 21:12:50,919 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:12:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:12:51,009 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2024-10-11 21:12:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 21:12:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 409 [2024-10-11 21:12:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:12:51,010 INFO L225 Difference]: With dead ends: 163 [2024-10-11 21:12:51,010 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 21:12:51,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 876 SyntacticMatches, 62 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 21:12:51,012 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:12:51,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:12:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 21:12:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 21:12:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.0077519379844961) internal successors, (130), 128 states have internal predecessors, (130), 21 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:12:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2024-10-11 21:12:51,020 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 409 [2024-10-11 21:12:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:12:51,021 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2024-10-11 21:12:51,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:12:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2024-10-11 21:12:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2024-10-11 21:12:51,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:12:51,037 INFO L215 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1] [2024-10-11 21:12:51,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 21:12:51,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 21:12:51,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:12:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:12:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2126609436, now seen corresponding path program 5 times [2024-10-11 21:12:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:12:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457865367] [2024-10-11 21:12:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:12:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:12:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:12:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:59,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:12:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:12:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:13:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:13:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:13:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:13:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-10-11 21:13:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:13:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:13:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2024-10-11 21:13:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:01,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:13:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:13:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:13:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:13:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:13:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:13:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:13:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:13:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2024-10-11 21:13:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:13:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457865367] [2024-10-11 21:13:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457865367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:13:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988441461] [2024-10-11 21:13:02,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 21:13:02,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:13:02,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:13:02,337 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:13:02,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:13:02,709 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2024-10-11 21:13:02,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:13:02,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 217 conjuncts are in the unsatisfiable core [2024-10-11 21:13:02,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:13:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2024-10-11 21:13:03,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:13:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2024-10-11 21:13:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988441461] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:13:38,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:13:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2024-10-11 21:13:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482885249] [2024-10-11 21:13:38,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:13:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 21:13:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:13:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 21:13:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 21:13:38,353 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2024-10-11 21:13:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:13:38,427 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2024-10-11 21:13:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 21:13:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) Word has length 1064 [2024-10-11 21:13:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:13:38,429 INFO L225 Difference]: With dead ends: 162 [2024-10-11 21:13:38,429 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:13:38,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2559 GetRequests, 2314 SyntacticMatches, 192 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7369 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 21:13:38,431 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:13:38,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:13:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:13:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:13:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:13:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:13:38,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1064 [2024-10-11 21:13:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:13:38,432 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:13:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2024-10-11 21:13:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:13:38,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:13:38,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 21:13:38,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 21:13:38,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 21:13:38,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 21:13:38,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 21:13:38,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 21:13:38,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 21:13:38,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 21:13:38,639 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 21:13:38,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:13:39,615 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:13:39,652 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 21:13:39,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:13:39 BoogieIcfgContainer [2024-10-11 21:13:39,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:13:39,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:13:39,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:13:39,655 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:13:39,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:12:30" (3/4) ... [2024-10-11 21:13:39,657 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:13:39,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2024-10-11 21:13:39,667 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:13:39,667 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 21:13:39,668 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:13:39,669 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:13:39,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:13:39,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:13:39,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:13:39,753 INFO L158 Benchmark]: Toolchain (without parser) took 69844.39ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 129.7MB in the beginning and 634.6MB in the end (delta: -505.0MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. [2024-10-11 21:13:39,753 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:13:39,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.10ms. Allocated memory is still 197.1MB. Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:13:39,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.64ms. Allocated memory is still 197.1MB. Free memory was 118.1MB in the beginning and 116.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:13:39,754 INFO L158 Benchmark]: Boogie Preprocessor took 23.99ms. Allocated memory is still 197.1MB. Free memory was 116.7MB in the beginning and 115.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:13:39,754 INFO L158 Benchmark]: RCFGBuilder took 275.93ms. Allocated memory is still 197.1MB. Free memory was 115.2MB in the beginning and 168.1MB in the end (delta: -53.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-11 21:13:39,754 INFO L158 Benchmark]: TraceAbstraction took 69193.16ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 167.3MB in the beginning and 639.9MB in the end (delta: -472.6MB). Peak memory consumption was 594.5MB. Max. memory is 16.1GB. [2024-10-11 21:13:39,755 INFO L158 Benchmark]: Witness Printer took 97.48ms. Allocated memory is still 1.3GB. Free memory was 638.8MB in the beginning and 634.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:13:39,756 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.10ms. Allocated memory is still 197.1MB. Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.64ms. Allocated memory is still 197.1MB. Free memory was 118.1MB in the beginning and 116.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.99ms. Allocated memory is still 197.1MB. Free memory was 116.7MB in the beginning and 115.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.93ms. Allocated memory is still 197.1MB. Free memory was 115.2MB in the beginning and 168.1MB in the end (delta: -53.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 69193.16ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 167.3MB in the beginning and 639.9MB in the end (delta: -472.6MB). Peak memory consumption was 594.5MB. Max. memory is 16.1GB. * Witness Printer took 97.48ms. Allocated memory is still 1.3GB. Free memory was 638.8MB in the beginning and 634.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 68.1s, OverallIterations: 15, TraceHistogramMax: 109, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1292 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1267 mSDsluCounter, 2499 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2098 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3483 IncrementalHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 401 mSDtfsCounter, 3483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5276 GetRequests, 4631 SyntacticMatches, 317 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11923 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=8, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 149 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 60.8s InterpolantComputationTime, 4528 NumberOfCodeBlocks, 4435 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 6664 ConstructedInterpolants, 0 QuantifiedInterpolants, 15463 SizeOfPredicates, 24 NumberOfNonLiveVariables, 4131 ConjunctsInSsa, 412 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 123225/151066 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci. Requires: (n <= 9) Ensures: ((n <= 9) && ((\result == 0) || (0 < n))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:13:39,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE