./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-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:10:54,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:10:54,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:10:54,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:10:54,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:10:54,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:10:54,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:10:54,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:10:54,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:10:54,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:10:54,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:10:54,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:10:54,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:10:54,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:10:54,196 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:10:54,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:10:54,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:10:54,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:10:54,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:10:54,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:10:54,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:10:54,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:10:54,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:10:54,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:10:54,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:10:54,199 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:10:54,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:10:54,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:10:54,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:10:54,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:10:54,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:10:54,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:10:54,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:10:54,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:10:54,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:10:54,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:10:54,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:10:54,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:10:54,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:10:54,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:10:54,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:10:54,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:10:54,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:10:54,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:10:54,204 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/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/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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2024-10-14 21:10:54,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:10:54,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:10:54,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:10:54,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:10:54,442 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:10:54,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-10-14 21:10:55,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:10:56,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:10:56,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-10-14 21:10:56,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41830d34/9715c2ddd841446b8a250ffdeaccc954/FLAG9778aebc1 [2024-10-14 21:10:56,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41830d34/9715c2ddd841446b8a250ffdeaccc954 [2024-10-14 21:10:56,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:10:56,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:10:56,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:10:56,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:10:56,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:10:56,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e548af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56, skipping insertion in model container [2024-10-14 21:10:56,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:10:56,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:10:56,681 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:10:56,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:10:56,720 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:10:56,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56 WrapperNode [2024-10-14 21:10:56,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:10:56,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:10:56,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:10:56,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:10:56,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,772 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2024-10-14 21:10:56,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:10:56,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:10:56,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:10:56,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:10:56,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,812 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-14 21:10:56,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:10:56,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:10:56,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:10:56,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:10:56,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (1/1) ... [2024-10-14 21:10:56,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:10:56,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:10:56,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:10:56,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:10:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:10:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:10:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:10:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:10:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-10-14 21:10:56,931 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-10-14 21:10:57,033 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:10:57,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:10:57,155 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 21:10:57,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:10:57,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:10:57,179 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 21:10:57,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:10:57 BoogieIcfgContainer [2024-10-14 21:10:57,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:10:57,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:10:57,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:10:57,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:10:57,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:10:56" (1/3) ... [2024-10-14 21:10:57,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cacdd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:10:57, skipping insertion in model container [2024-10-14 21:10:57,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:10:56" (2/3) ... [2024-10-14 21:10:57,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cacdd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:10:57, skipping insertion in model container [2024-10-14 21:10:57,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:10:57" (3/3) ... [2024-10-14 21:10:57,186 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2024-10-14 21:10:57,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:10:57,199 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 21:10:57,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:10:57,243 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;@2625aa9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:10:57,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 21:10:57,246 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-14 21:10:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 21:10:57,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:10:57,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 21:10:57,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:10:57,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:10:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1905229472, now seen corresponding path program 1 times [2024-10-14 21:10:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:10:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909311897] [2024-10-14 21:10:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:10:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,376 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-14 21:10:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909311897] [2024-10-14 21:10:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909311897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:10:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:10:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:10:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251840250] [2024-10-14 21:10:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:10:57,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:10:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:10:57,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:10:57,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:10:57,400 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-14 21:10:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:10:57,447 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-14 21:10:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:10:57,449 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-14 21:10:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:10:57,454 INFO L225 Difference]: With dead ends: 31 [2024-10-14 21:10:57,454 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 21:10:57,456 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-14 21:10:57,459 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-14 21:10:57,459 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-14 21:10:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 21:10:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-14 21:10:57,483 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-14 21:10:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-14 21:10:57,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2024-10-14 21:10:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:10:57,486 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-14 21:10:57,486 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-14 21:10:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-14 21:10:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 21:10:57,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:10:57,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:10:57,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:10:57,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:10:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:10:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1067428573, now seen corresponding path program 1 times [2024-10-14 21:10:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:10:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954186926] [2024-10-14 21:10:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:10:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,535 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-14 21:10:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954186926] [2024-10-14 21:10:57,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954186926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:10:57,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:10:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:10:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81179550] [2024-10-14 21:10:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:10:57,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:10:57,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:10:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:10:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:10:57,538 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-14 21:10:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:10:57,585 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-14 21:10:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:10:57,586 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-14 21:10:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:10:57,587 INFO L225 Difference]: With dead ends: 23 [2024-10-14 21:10:57,587 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 21:10:57,587 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-14 21:10:57,588 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-14 21:10:57,588 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-14 21:10:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 21:10:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-14 21:10:57,591 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-14 21:10:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-14 21:10:57,592 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2024-10-14 21:10:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:10:57,593 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-14 21:10:57,593 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-14 21:10:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-14 21:10:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 21:10:57,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:10:57,594 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-14 21:10:57,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:10:57,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:10:57,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:10:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash 803661136, now seen corresponding path program 1 times [2024-10-14 21:10:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:10:57,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44314823] [2024-10-14 21:10:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:10:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:10:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 21:10:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,733 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-14 21:10:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44314823] [2024-10-14 21:10:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44314823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:10:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:10:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:10:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979710069] [2024-10-14 21:10:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:10:57,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:10:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:10:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:10:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:10:57,740 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-14 21:10:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:10:57,780 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-14 21:10:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:10:57,781 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-14 21:10:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:10:57,783 INFO L225 Difference]: With dead ends: 33 [2024-10-14 21:10:57,783 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 21:10:57,784 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-14 21:10:57,787 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-14 21:10:57,787 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-14 21:10:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 21:10:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-14 21:10:57,795 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-14 21:10:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-14 21:10:57,796 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2024-10-14 21:10:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:10:57,797 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-14 21:10:57,797 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-14 21:10:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-14 21:10:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:10:57,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:10:57,798 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-14 21:10:57,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:10:57,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:10:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:10:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1946561503, now seen corresponding path program 1 times [2024-10-14 21:10:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:10:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533939144] [2024-10-14 21:10:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:10:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:10:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 21:10:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:57,969 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-14 21:10:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533939144] [2024-10-14 21:10:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533939144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:10:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866744247] [2024-10-14 21:10:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:10:57,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:10:57,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:10:57,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:10:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:58,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:10:58,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:10:58,140 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-14 21:10:58,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:10:58,293 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-14 21:10:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866744247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:10:58,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:10:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-10-14 21:10:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77826578] [2024-10-14 21:10:58,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:10:58,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 21:10:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:10:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 21:10:58,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-14 21:10:58,299 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-14 21:10:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:10:58,823 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2024-10-14 21:10:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 21:10:58,824 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-14 21:10:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:10:58,825 INFO L225 Difference]: With dead ends: 177 [2024-10-14 21:10:58,826 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 21:10:58,827 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-14 21:10:58,828 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 154 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:10:58,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 301 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:10:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 21:10:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2024-10-14 21:10:58,851 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-14 21:10:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2024-10-14 21:10:58,854 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 29 [2024-10-14 21:10:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:10:58,854 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2024-10-14 21:10:58,855 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-14 21:10:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2024-10-14 21:10:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:10:58,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:10:58,861 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-14 21:10:58,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:10:59,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:10:59,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:10:59,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:10:59,064 INFO L85 PathProgramCache]: Analyzing trace with hash -239885825, now seen corresponding path program 2 times [2024-10-14 21:10:59,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:10:59,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100567157] [2024-10-14 21:10:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:10:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:10:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:10:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,236 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-14 21:10:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100567157] [2024-10-14 21:10:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100567157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:10:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594912482] [2024-10-14 21:10:59,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:10:59,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:10:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:10:59,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:10:59,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:10:59,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:10:59,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:10:59,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:10:59,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:10:59,316 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-14 21:10:59,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:10:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594912482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:10:59,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:10:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-14 21:10:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089355394] [2024-10-14 21:10:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:10:59,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:10:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:10:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:10:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:10:59,318 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-14 21:10:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:10:59,345 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2024-10-14 21:10:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:10:59,346 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-14 21:10:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:10:59,348 INFO L225 Difference]: With dead ends: 151 [2024-10-14 21:10:59,348 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 21:10:59,349 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-14 21:10:59,349 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-14 21:10:59,350 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-14 21:10:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 21:10:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2024-10-14 21:10:59,368 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-14 21:10:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-14 21:10:59,370 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 41 [2024-10-14 21:10:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:10:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-14 21:10:59,371 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-14 21:10:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-14 21:10:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 21:10:59,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:10:59,372 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-14 21:10:59,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 21:10:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:10:59,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:10:59,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:10:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1153474090, now seen corresponding path program 1 times [2024-10-14 21:10:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:10:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624224423] [2024-10-14 21:10:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:10:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:10:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:10:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,641 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-14 21:10:59,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:10:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624224423] [2024-10-14 21:10:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624224423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:10:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850743773] [2024-10-14 21:10:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:10:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:10:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:10:59,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:10:59,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:10:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:10:59,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:10:59,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:10:59,811 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-14 21:10:59,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:00,031 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-14 21:11:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850743773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:00,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 27 [2024-10-14 21:11:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241101978] [2024-10-14 21:11:00,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:11:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:11:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:11:00,034 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 27 states, 25 states have (on average 3.04) internal successors, (76), 19 states have internal predecessors, (76), 13 states have call successors, (15), 10 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-14 21:11:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:01,055 INFO L93 Difference]: Finished difference Result 451 states and 714 transitions. [2024-10-14 21:11:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-14 21:11:01,056 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.04) internal successors, (76), 19 states have internal predecessors, (76), 13 states have call successors, (15), 10 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-14 21:11:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:01,059 INFO L225 Difference]: With dead ends: 451 [2024-10-14 21:11:01,059 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 21:11:01,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 21:11:01,067 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 248 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:01,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 706 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 21:11:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 21:11:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 294. [2024-10-14 21:11:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.0995670995670996) internal successors, (254), 231 states have internal predecessors, (254), 37 states have call successors, (37), 11 states have call predecessors, (37), 24 states have return successors, (109), 51 states have call predecessors, (109), 36 states have call successors, (109) [2024-10-14 21:11:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2024-10-14 21:11:01,110 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 42 [2024-10-14 21:11:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:01,110 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2024-10-14 21:11:01,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.04) internal successors, (76), 19 states have internal predecessors, (76), 13 states have call successors, (15), 10 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-14 21:11:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2024-10-14 21:11:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 21:11:01,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:01,112 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:11:01,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:11:01,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:01,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 948409523, now seen corresponding path program 1 times [2024-10-14 21:11:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131464447] [2024-10-14 21:11:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:11:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:11:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-10-14 21:11:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:01,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131464447] [2024-10-14 21:11:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131464447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:11:01,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:11:01,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:11:01,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463924719] [2024-10-14 21:11:01,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:11:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:11:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:01,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:11:01,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:11:01,496 INFO L87 Difference]: Start difference. First operand 294 states and 400 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-14 21:11:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:01,547 INFO L93 Difference]: Finished difference Result 308 states and 422 transitions. [2024-10-14 21:11:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:11:01,548 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 73 [2024-10-14 21:11:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:01,555 INFO L225 Difference]: With dead ends: 308 [2024-10-14 21:11:01,555 INFO L226 Difference]: Without dead ends: 307 [2024-10-14 21:11:01,555 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-14 21:11:01,556 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-14 21:11:01,556 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-14 21:11:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-14 21:11:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-10-14 21:11:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.0970464135021096) internal successors, (260), 236 states have internal predecessors, (260), 38 states have call successors, (38), 11 states have call predecessors, (38), 24 states have return successors, (115), 53 states have call predecessors, (115), 37 states have call successors, (115) [2024-10-14 21:11:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2024-10-14 21:11:01,602 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 73 [2024-10-14 21:11:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:01,603 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2024-10-14 21:11:01,603 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-14 21:11:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2024-10-14 21:11:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 21:11:01,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:01,609 INFO L215 NwaCegarLoop]: trace histogram [13, 11, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:11:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 21:11:01,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1587495797, now seen corresponding path program 1 times [2024-10-14 21:11:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731171701] [2024-10-14 21:11:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:11:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 21:11:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-10-14 21:11:01,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731171701] [2024-10-14 21:11:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731171701] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575600232] [2024-10-14 21:11:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:01,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:01,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:11:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:01,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 21:11:01,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 111 proven. 234 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 21:11:02,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 2 proven. 346 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:11:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575600232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:02,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:02,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 23, 23] total 27 [2024-10-14 21:11:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673914778] [2024-10-14 21:11:02,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:02,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:11:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:11:02,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:11:02,592 INFO L87 Difference]: Start difference. First operand 301 states and 413 transitions. Second operand has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 18 states have internal predecessors, (88), 13 states have call successors, (17), 11 states have call predecessors, (17), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:11:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:03,111 INFO L93 Difference]: Finished difference Result 652 states and 942 transitions. [2024-10-14 21:11:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 21:11:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 18 states have internal predecessors, (88), 13 states have call successors, (17), 11 states have call predecessors, (17), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2024-10-14 21:11:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:03,114 INFO L225 Difference]: With dead ends: 652 [2024-10-14 21:11:03,114 INFO L226 Difference]: Without dead ends: 365 [2024-10-14 21:11:03,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 154 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 21:11:03,117 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 297 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:03,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 544 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:11:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-14 21:11:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 331. [2024-10-14 21:11:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 259 states have internal predecessors, (286), 42 states have call successors, (42), 12 states have call predecessors, (42), 26 states have return successors, (130), 59 states have call predecessors, (130), 41 states have call successors, (130) [2024-10-14 21:11:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2024-10-14 21:11:03,151 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 90 [2024-10-14 21:11:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:03,152 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2024-10-14 21:11:03,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 18 states have internal predecessors, (88), 13 states have call successors, (17), 11 states have call predecessors, (17), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:11:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2024-10-14 21:11:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 21:11:03,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:03,156 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:11:03,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 21:11:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:03,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:03,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1754244090, now seen corresponding path program 2 times [2024-10-14 21:11:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:03,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482371582] [2024-10-14 21:11:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:11:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:11:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:11:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-10-14 21:11:03,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:03,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482371582] [2024-10-14 21:11:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482371582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4134711] [2024-10-14 21:11:03,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:11:03,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:03,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:03,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 21:11:03,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:11:03,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:11:03,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:11:03,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-10-14 21:11:03,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-10-14 21:11:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4134711] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:03,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-14 21:11:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908536599] [2024-10-14 21:11:03,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:03,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 21:11:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 21:11:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:11:03,678 INFO L87 Difference]: Start difference. First operand 331 states and 458 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-14 21:11:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:03,773 INFO L93 Difference]: Finished difference Result 352 states and 483 transitions. [2024-10-14 21:11:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 21:11:03,774 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 91 [2024-10-14 21:11:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:03,776 INFO L225 Difference]: With dead ends: 352 [2024-10-14 21:11:03,776 INFO L226 Difference]: Without dead ends: 351 [2024-10-14 21:11:03,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:11:03,777 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:03,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:11:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-14 21:11:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 331. [2024-10-14 21:11:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 259 states have internal predecessors, (286), 42 states have call successors, (42), 12 states have call predecessors, (42), 26 states have return successors, (130), 59 states have call predecessors, (130), 41 states have call successors, (130) [2024-10-14 21:11:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2024-10-14 21:11:03,797 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 91 [2024-10-14 21:11:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:03,797 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2024-10-14 21:11:03,797 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-14 21:11:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2024-10-14 21:11:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 21:11:03,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:03,799 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:11:03,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:11:04,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:04,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1453008131, now seen corresponding path program 1 times [2024-10-14 21:11:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323456568] [2024-10-14 21:11:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:11:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:11:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:11:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 231 proven. 130 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 21:11:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323456568] [2024-10-14 21:11:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323456568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161632136] [2024-10-14 21:11:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:04,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:04,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:04,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:04,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:11:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:04,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 21:11:04,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 227 proven. 133 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:11:04,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 227 proven. 133 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:11:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161632136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:04,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 28 [2024-10-14 21:11:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170131671] [2024-10-14 21:11:04,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 21:11:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 21:11:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-10-14 21:11:04,808 INFO L87 Difference]: Start difference. First operand 331 states and 458 transitions. Second operand has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 19 states have internal predecessors, (83), 13 states have call successors, (15), 10 states have call predecessors, (15), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 21:11:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:05,387 INFO L93 Difference]: Finished difference Result 532 states and 737 transitions. [2024-10-14 21:11:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-14 21:11:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 19 states have internal predecessors, (83), 13 states have call successors, (15), 10 states have call predecessors, (15), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 92 [2024-10-14 21:11:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:05,388 INFO L225 Difference]: With dead ends: 532 [2024-10-14 21:11:05,388 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 21:11:05,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 177 SyntacticMatches, 20 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1007, Invalid=2899, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 21:11:05,392 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 746 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:05,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 156 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:11:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 21:11:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 178. [2024-10-14 21:11:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.1347517730496455) internal successors, (160), 141 states have internal predecessors, (160), 23 states have call successors, (23), 14 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 21:11:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-10-14 21:11:05,399 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 92 [2024-10-14 21:11:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:05,399 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-10-14 21:11:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 19 states have internal predecessors, (83), 13 states have call successors, (15), 10 states have call predecessors, (15), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 21:11:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-10-14 21:11:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 21:11:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:05,400 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-14 21:11:05,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 21:11:05,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:05,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:05,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1790678057, now seen corresponding path program 2 times [2024-10-14 21:11:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:05,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190759351] [2024-10-14 21:11:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:11:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 21:11:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-14 21:11:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190759351] [2024-10-14 21:11:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190759351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668517343] [2024-10-14 21:11:05,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:11:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:05,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:05,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:11:05,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:11:05,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:11:05,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:11:05,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-14 21:11:05,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-14 21:11:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668517343] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:05,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-10-14 21:11:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955773708] [2024-10-14 21:11:05,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:11:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:11:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:11:05,977 INFO L87 Difference]: Start difference. First operand 178 states and 205 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-14 21:11:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:06,030 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-10-14 21:11:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 21:11:06,031 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 86 [2024-10-14 21:11:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:06,032 INFO L225 Difference]: With dead ends: 179 [2024-10-14 21:11:06,032 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 21:11:06,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 173 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-14 21:11:06,033 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:06,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:11:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 21:11:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-10-14 21:11:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.1205673758865249) internal successors, (158), 141 states have internal predecessors, (158), 23 states have call successors, (23), 14 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 21:11:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-10-14 21:11:06,045 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 86 [2024-10-14 21:11:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:06,045 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-10-14 21:11:06,045 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-14 21:11:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-10-14 21:11:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 21:11:06,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:06,048 INFO L215 NwaCegarLoop]: trace histogram [15, 13, 10, 10, 10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2024-10-14 21:11:06,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:11:06,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:06,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:06,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1426265217, now seen corresponding path program 3 times [2024-10-14 21:11:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:06,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044817942] [2024-10-14 21:11:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 21:11:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 21:11:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-10-14 21:11:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044817942] [2024-10-14 21:11:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044817942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360889674] [2024-10-14 21:11:06,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:11:06,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:06,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:06,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:06,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:11:06,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-14 21:11:06,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:11:06,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:11:06,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-10-14 21:11:06,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-10-14 21:11:06,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360889674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:06,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-10-14 21:11:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20294452] [2024-10-14 21:11:06,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:06,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 21:11:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 21:11:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:11:06,809 INFO L87 Difference]: Start difference. First operand 178 states and 203 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-14 21:11:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:06,916 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2024-10-14 21:11:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:11:06,917 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 118 [2024-10-14 21:11:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:06,918 INFO L225 Difference]: With dead ends: 178 [2024-10-14 21:11:06,918 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 21:11:06,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 249 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-14 21:11:06,919 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:06,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 146 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:11:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 21:11:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-14 21:11:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.0567375886524824) internal successors, (149), 140 states have internal predecessors, (149), 23 states have call successors, (23), 14 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 21:11:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 194 transitions. [2024-10-14 21:11:06,928 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 194 transitions. Word has length 118 [2024-10-14 21:11:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:06,928 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 194 transitions. [2024-10-14 21:11:06,928 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-14 21:11:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 194 transitions. [2024-10-14 21:11:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 21:11:06,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:06,930 INFO L215 NwaCegarLoop]: trace histogram [20, 17, 14, 12, 12, 12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1] [2024-10-14 21:11:06,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:11:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 21:11:07,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1914996354, now seen corresponding path program 3 times [2024-10-14 21:11:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923637035] [2024-10-14 21:11:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 21:11:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 21:11:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2024-10-14 21:11:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923637035] [2024-10-14 21:11:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923637035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443026436] [2024-10-14 21:11:07,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:11:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:07,713 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:07,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:11:07,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 21:11:07,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:11:07,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 21:11:07,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2024-10-14 21:11:07,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-10-14 21:11:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443026436] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:08,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2024-10-14 21:11:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552059099] [2024-10-14 21:11:08,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:11:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:11:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:11:08,906 INFO L87 Difference]: Start difference. First operand 177 states and 194 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-14 21:11:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:08,965 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2024-10-14 21:11:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 21:11:08,965 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 172 [2024-10-14 21:11:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:08,966 INFO L225 Difference]: With dead ends: 178 [2024-10-14 21:11:08,967 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 21:11:08,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 358 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-14 21:11:08,968 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:08,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:11:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 21:11:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-14 21:11:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 140 states have internal predecessors, (146), 23 states have call successors, (23), 14 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 21:11:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2024-10-14 21:11:08,976 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 172 [2024-10-14 21:11:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:08,977 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2024-10-14 21:11:08,977 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-14 21:11:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2024-10-14 21:11:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-10-14 21:11:08,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:08,981 INFO L215 NwaCegarLoop]: trace histogram [44, 40, 36, 23, 23, 23, 23, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1] [2024-10-14 21:11:08,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:11:09,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 21:11:09,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:09,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1438043800, now seen corresponding path program 4 times [2024-10-14 21:11:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:09,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696888174] [2024-10-14 21:11:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:09,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:11:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:11:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-14 21:11:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4239 trivial. 0 not checked. [2024-10-14 21:11:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696888174] [2024-10-14 21:11:11,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696888174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929167484] [2024-10-14 21:11:11,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 21:11:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:11,315 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:11,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:11:11,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 21:11:11,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:11:11,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-14 21:11:11,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4239 trivial. 0 not checked. [2024-10-14 21:11:11,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:11:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 4007 trivial. 0 not checked. [2024-10-14 21:11:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929167484] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:11:17,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:11:17,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2024-10-14 21:11:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710007607] [2024-10-14 21:11:17,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:11:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 21:11:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:11:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 21:11:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 21:11:17,821 INFO L87 Difference]: Start difference. First operand 177 states and 191 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-14 21:11:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:11:17,909 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2024-10-14 21:11:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 21:11:17,909 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 415 [2024-10-14 21:11:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:11:17,911 INFO L225 Difference]: With dead ends: 178 [2024-10-14 21:11:17,911 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 21:11:17,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 888 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-14 21:11:17,912 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:11:17,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 109 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:11:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 21:11:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-14 21:11:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.0141843971631206) internal successors, (143), 140 states have internal predecessors, (143), 23 states have call successors, (23), 14 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 21:11:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2024-10-14 21:11:17,920 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 415 [2024-10-14 21:11:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:11:17,921 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2024-10-14 21:11:17,922 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-14 21:11:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2024-10-14 21:11:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2024-10-14 21:11:17,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:11:17,941 INFO L215 NwaCegarLoop]: trace histogram [110, 108, 89, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1] [2024-10-14 21:11:17,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 21:11:18,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 21:11:18,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:11:18,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:11:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1534660571, now seen corresponding path program 5 times [2024-10-14 21:11:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:11:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57866737] [2024-10-14 21:11:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:11:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:11:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:11:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:11:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 21:11:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-10-14 21:11:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:11:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2024-10-14 21:11:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 21:11:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 21:11:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:11:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:11:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:11:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:11:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 21:11:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:11:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 27393 trivial. 0 not checked. [2024-10-14 21:11:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:11:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57866737] [2024-10-14 21:11:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57866737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:11:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595739032] [2024-10-14 21:11:28,176 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 21:11:28,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:11:28,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:11:28,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:11:28,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:11:28,614 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2024-10-14 21:11:28,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:11:28,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 1998 conjuncts, 217 conjuncts are in the unsatisfiable core [2024-10-14 21:11:28,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:11:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 27393 trivial. 0 not checked. [2024-10-14 21:11:29,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26679 trivial. 0 not checked. [2024-10-14 21:12:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595739032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:06,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2024-10-14 21:12:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535226559] [2024-10-14 21:12:06,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:06,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-14 21:12:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-14 21:12:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:12:06,233 INFO L87 Difference]: Start difference. First operand 177 states and 188 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-14 21:12:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:06,330 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2024-10-14 21:12:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 21:12:06,330 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 1070 [2024-10-14 21:12:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:06,332 INFO L225 Difference]: With dead ends: 177 [2024-10-14 21:12:06,332 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:12:06,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2572 GetRequests, 2326 SyntacticMatches, 192 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7409 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=660, Invalid=2420, Unknown=0, NotChecked=0, Total=3080 [2024-10-14 21:12:06,334 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:06,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 204 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:12:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:12:06,334 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-14 21:12:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:12:06,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1070 [2024-10-14 21:12:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:06,335 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:12:06,335 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-14 21:12:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:12:06,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:12:06,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 21:12:06,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 21:12:06,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 21:12:06,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 21:12:06,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 21:12:06,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 21:12:06,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:12:06,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 21:12:06,541 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2024-10-14 21:12:06,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:12:07,577 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:12:07,618 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 21:12:07,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:12:07 BoogieIcfgContainer [2024-10-14 21:12:07,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:12:07,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:12:07,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:12:07,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:12:07,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:10:57" (3/4) ... [2024-10-14 21:12:07,626 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:12:07,629 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2024-10-14 21:12:07,632 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 21:12:07,632 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 21:12:07,632 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:12:07,632 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:12:07,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:12:07,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:12:07,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:12:07,702 INFO L158 Benchmark]: Toolchain (without parser) took 71265.18ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 110.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-10-14 21:12:07,704 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 180.4MB. Free memory was 137.1MB in the beginning and 136.9MB in the end (delta: 174.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:12:07,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.62ms. Allocated memory is still 180.4MB. Free memory was 109.9MB in the beginning and 99.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:12:07,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.47ms. Allocated memory is still 180.4MB. Free memory was 99.1MB in the beginning and 97.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:12:07,705 INFO L158 Benchmark]: Boogie Preprocessor took 48.37ms. Allocated memory is still 180.4MB. Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:12:07,705 INFO L158 Benchmark]: RCFGBuilder took 353.65ms. Allocated memory is still 180.4MB. Free memory was 96.1MB in the beginning and 144.0MB in the end (delta: -47.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:12:07,705 INFO L158 Benchmark]: TraceAbstraction took 70443.03ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 142.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 968.8MB. Max. memory is 16.1GB. [2024-10-14 21:12:07,706 INFO L158 Benchmark]: Witness Printer took 78.22ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:12:07,707 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.89ms. Allocated memory is still 180.4MB. Free memory was 137.1MB in the beginning and 136.9MB in the end (delta: 174.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.62ms. Allocated memory is still 180.4MB. Free memory was 109.9MB in the beginning and 99.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.47ms. Allocated memory is still 180.4MB. Free memory was 99.1MB in the beginning and 97.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.37ms. Allocated memory is still 180.4MB. Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.65ms. Allocated memory is still 180.4MB. Free memory was 96.1MB in the beginning and 144.0MB in the end (delta: -47.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 70443.03ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 142.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 968.8MB. Max. memory is 16.1GB. * Witness Printer took 78.22ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB 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: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: 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: 69.3s, OverallIterations: 15, TraceHistogramMax: 110, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1546 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1520 mSDsluCounter, 2678 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2259 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3935 IncrementalHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 419 mSDtfsCounter, 3935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5352 GetRequests, 4692 SyntacticMatches, 319 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12332 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=8, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 157 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 61.8s InterpolantComputationTime, 4600 NumberOfCodeBlocks, 4495 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 6769 ConstructedInterpolants, 0 QuantifiedInterpolants, 15628 SizeOfPredicates, 26 NumberOfNonLiveVariables, 4163 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 125979/153928 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: 7]: Procedure Contract for fibo Derived contract for procedure fibo. Requires: (n <= 10) Ensures: (n <= 10) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:12:07,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE