./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-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6546395432109233bf3e1991428a566548dd822bb23ca198622322bf4db5a8a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:13:55,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:13:55,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:13:55,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:13:55,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:13:55,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:13:55,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:13:55,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:13:55,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:13:55,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:13:55,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:13:55,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:13:55,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:13:55,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:13:55,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:13:55,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:13:55,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:13:55,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:13:55,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:13:55,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:13:55,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:13:55,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:13:55,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:13:55,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:13:55,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:13:55,988 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:13:55,988 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:13:55,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:13:55,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:13:55,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:13:55,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:13:55,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:13:55,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:13:55,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:13:55,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:13:55,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:13:55,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:13:55,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:13:55,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:13:55,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:13:55,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:13:55,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:13:55,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:13:55,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:13:55,993 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a6546395432109233bf3e1991428a566548dd822bb23ca198622322bf4db5a8a [2024-10-11 21:13:56,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:13:56,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:13:56,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:13:56,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:13:56,216 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:13:56,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2024-10-11 21:13:57,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:13:57,595 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:13:57,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2024-10-11 21:13:57,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/638150d02/bbf2d36b90584c70acbf095460ac4257/FLAGacaf38c74 [2024-10-11 21:13:57,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/638150d02/bbf2d36b90584c70acbf095460ac4257 [2024-10-11 21:13:57,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:13:57,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:13:57,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:13:57,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:13:57,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:13:57,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de64ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57, skipping insertion in model container [2024-10-11 21:13:57,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:13:57,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:13:57,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:13:57,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:13:57,855 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:13:57,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57 WrapperNode [2024-10-11 21:13:57,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:13:57,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:13:57,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:13:57,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:13:57,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,880 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2024-10-11 21:13:57,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:13:57,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:13:57,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:13:57,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:13:57,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,899 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:13:57,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:13:57,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:13:57,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:13:57,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:13:57,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (1/1) ... [2024-10-11 21:13:57,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:13:57,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:13:57,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:13:57,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:13:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:13:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:13:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:13:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:13:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-10-11 21:13:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-10-11 21:13:58,053 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:13:58,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:13:58,185 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 21:13:58,187 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:13:58,216 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:13:58,217 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:13:58,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:13:58 BoogieIcfgContainer [2024-10-11 21:13:58,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:13:58,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:13:58,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:13:58,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:13:58,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:13:57" (1/3) ... [2024-10-11 21:13:58,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d04a3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:13:58, skipping insertion in model container [2024-10-11 21:13:58,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:57" (2/3) ... [2024-10-11 21:13:58,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d04a3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:13:58, skipping insertion in model container [2024-10-11 21:13:58,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:13:58" (3/3) ... [2024-10-11 21:13:58,230 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-2.c [2024-10-11 21:13:58,244 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:13:58,245 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 21:13:58,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:13:58,308 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;@6f1bc35f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:13:58,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 21:13:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:13:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:13:58,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:13:58,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:13:58,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:13:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:13:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1905229472, now seen corresponding path program 1 times [2024-10-11 21:13:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:13:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392449778] [2024-10-11 21:13:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:13:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:13:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:13:58,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:13:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392449778] [2024-10-11 21:13:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392449778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:13:58,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:13:58,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:13:58,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426332172] [2024-10-11 21:13:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:13:58,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:13:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:13:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:13:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:13:58,514 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:13:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:13:58,552 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-11 21:13:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:13:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 21:13:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:13:58,560 INFO L225 Difference]: With dead ends: 31 [2024-10-11 21:13:58,560 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 21:13:58,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:13:58,565 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:13:58,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:13:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 21:13:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-11 21:13:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:13:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-11 21:13:58,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2024-10-11 21:13:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:13:58,595 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-11 21:13:58,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:13:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-11 21:13:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 21:13:58,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:13:58,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:13:58,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:13:58,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:13:58,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:13:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1067428573, now seen corresponding path program 1 times [2024-10-11 21:13:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:13:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766181341] [2024-10-11 21:13:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:13:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:13:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:13:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:13:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766181341] [2024-10-11 21:13:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766181341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:13:58,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:13:58,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:13:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298437302] [2024-10-11 21:13:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:13:58,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:13:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:13:58,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:13:58,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:13:58,723 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:13:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:13:58,789 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-11 21:13:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:13:58,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 21:13:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:13:58,791 INFO L225 Difference]: With dead ends: 23 [2024-10-11 21:13:58,791 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 21:13:58,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:13:58,792 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:13:58,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:13:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 21:13:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-11 21:13:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:13:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-11 21:13:58,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2024-10-11 21:13:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:13:58,801 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-11 21:13:58,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:13:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-11 21:13:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 21:13:58,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:13:58,802 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:13:58,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:13:58,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:13:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:13:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 803661136, now seen corresponding path program 1 times [2024-10-11 21:13:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:13:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47060714] [2024-10-11 21:13:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:13:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:13:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:13:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:13:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:13:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:13:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47060714] [2024-10-11 21:13:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47060714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:13:59,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:13:59,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:13:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744293934] [2024-10-11 21:13:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:13:59,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:13:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:13:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:13:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:13:59,004 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:13:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:13:59,048 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 21:13:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:13:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-11 21:13:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:13:59,051 INFO L225 Difference]: With dead ends: 33 [2024-10-11 21:13:59,052 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 21:13:59,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:13:59,054 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:13:59,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:13:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 21:13:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-11 21:13:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:13:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 21:13:59,067 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2024-10-11 21:13:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:13:59,068 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 21:13:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:13:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 21:13:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 21:13:59,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:13:59,069 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:13:59,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:13:59,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:13:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:13:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1946561503, now seen corresponding path program 1 times [2024-10-11 21:13:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:13:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314158280] [2024-10-11 21:13:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:13:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:13:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:13:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 21:13:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:13:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:13:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314158280] [2024-10-11 21:13:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314158280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:13:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657307237] [2024-10-11 21:13:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:13:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:13:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:13:59,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:13:59,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:13:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:13:59,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:13:59,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:13:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:13:59,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:13:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:13:59,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657307237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:13:59,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:13:59,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-10-11 21:13:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004477485] [2024-10-11 21:13:59,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:13:59,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 21:13:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:13:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 21:13:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:13:59,566 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:14:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:00,045 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2024-10-11 21:14:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:14:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-10-11 21:14:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:00,049 INFO L225 Difference]: With dead ends: 177 [2024-10-11 21:14:00,049 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 21:14:00,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:14:00,054 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-11 21:14:00,055 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-11 21:14:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 21:14:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2024-10-11 21:14:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (46), 21 states have call predecessors, (46), 16 states have call successors, (46) [2024-10-11 21:14:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2024-10-11 21:14:00,097 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 29 [2024-10-11 21:14:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:00,097 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2024-10-11 21:14:00,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:14:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2024-10-11 21:14:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 21:14:00,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:00,099 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 21:14:00,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:00,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:00,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:00,300 INFO L85 PathProgramCache]: Analyzing trace with hash -239885825, now seen corresponding path program 2 times [2024-10-11 21:14:00,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:00,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269850671] [2024-10-11 21:14:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:14:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:14:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:14:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269850671] [2024-10-11 21:14:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269850671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758846697] [2024-10-11 21:14:00,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:14:00,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:00,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:00,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:14:00,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:14:00,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:00,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:14:00,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:14:00,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:14:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758846697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:00,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:14:00,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 21:14:00,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135661939] [2024-10-11 21:14:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:00,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:14:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:14:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:14:00,485 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:00,524 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2024-10-11 21:14:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:14:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-10-11 21:14:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:00,528 INFO L225 Difference]: With dead ends: 151 [2024-10-11 21:14:00,528 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 21:14:00,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:14:00,531 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:00,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 21:14:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2024-10-11 21:14:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 106 states have internal predecessors, (117), 17 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (55), 24 states have call predecessors, (55), 16 states have call successors, (55) [2024-10-11 21:14:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-11 21:14:00,557 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 41 [2024-10-11 21:14:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-11 21:14:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-11 21:14:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 21:14:00,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:00,560 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:00,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 21:14:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:00,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1153474090, now seen corresponding path program 1 times [2024-10-11 21:14:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942058917] [2024-10-11 21:14:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:14:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:14:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 21:14:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942058917] [2024-10-11 21:14:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942058917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126085970] [2024-10-11 21:14:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:00,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:00,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:00,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:00,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:14:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:00,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 21:14:00,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:14:01,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:14:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126085970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:01,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 27 [2024-10-11 21:14:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574746217] [2024-10-11 21:14:01,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 21:14:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 21:14:01,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:14:01,227 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-11 21:14:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:02,178 INFO L93 Difference]: Finished difference Result 451 states and 714 transitions. [2024-10-11 21:14:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 21:14:02,179 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-11 21:14:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:02,184 INFO L225 Difference]: With dead ends: 451 [2024-10-11 21:14:02,184 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 21:14:02,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 21:14:02,193 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 248 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:02,193 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.6s Time] [2024-10-11 21:14:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 21:14:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 294. [2024-10-11 21:14:02,235 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-11 21:14:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2024-10-11 21:14:02,242 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 42 [2024-10-11 21:14:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:02,242 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2024-10-11 21:14:02,242 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-11 21:14:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2024-10-11 21:14:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 21:14:02,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:02,246 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-11 21:14:02,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:14:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:02,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:02,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 948409523, now seen corresponding path program 1 times [2024-10-11 21:14:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320530927] [2024-10-11 21:14:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:14:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:14:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,573 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-11 21:14:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320530927] [2024-10-11 21:14:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320530927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:14:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270158781] [2024-10-11 21:14:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:02,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:14:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:14:02,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:14:02,574 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-11 21:14:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:02,613 INFO L93 Difference]: Finished difference Result 308 states and 422 transitions. [2024-10-11 21:14:02,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:14:02,614 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-11 21:14:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:02,616 INFO L225 Difference]: With dead ends: 308 [2024-10-11 21:14:02,616 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 21:14:02,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:14:02,616 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:02,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 21:14:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-10-11 21:14:02,646 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-11 21:14:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2024-10-11 21:14:02,648 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 73 [2024-10-11 21:14:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:02,649 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2024-10-11 21:14:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2024-10-11 21:14:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 21:14:02,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:02,651 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-11 21:14:02,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:14:02,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:02,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1587495797, now seen corresponding path program 1 times [2024-10-11 21:14:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669978611] [2024-10-11 21:14:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:14:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 21:14:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,760 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-11 21:14:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669978611] [2024-10-11 21:14:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669978611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167205916] [2024-10-11 21:14:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:02,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:02,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:14:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 21:14:02,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:03,076 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-11 21:14:03,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:03,385 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-11 21:14:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167205916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:03,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:03,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 23, 23] total 27 [2024-10-11 21:14:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181084843] [2024-10-11 21:14:03,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 21:14:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 21:14:03,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:14:03,388 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-11 21:14:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:04,025 INFO L93 Difference]: Finished difference Result 652 states and 942 transitions. [2024-10-11 21:14:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 21:14:04,026 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-11 21:14:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:04,028 INFO L225 Difference]: With dead ends: 652 [2024-10-11 21:14:04,028 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 21:14:04,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 154 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 21:14:04,036 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-11 21:14:04,036 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-11 21:14:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 21:14:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 331. [2024-10-11 21:14:04,060 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-11 21:14:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2024-10-11 21:14:04,065 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 90 [2024-10-11 21:14:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:04,065 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2024-10-11 21:14:04,065 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-11 21:14:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2024-10-11 21:14:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 21:14:04,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:04,067 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-11 21:14:04,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:14:04,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 21:14:04,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:04,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1754244090, now seen corresponding path program 2 times [2024-10-11 21:14:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753793252] [2024-10-11 21:14:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:14:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:14:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:14:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,360 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-11 21:14:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753793252] [2024-10-11 21:14:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753793252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689684845] [2024-10-11 21:14:04,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:14:04,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:04,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:04,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:14:04,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:14:04,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:04,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:14:04,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:04,442 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-11 21:14:04,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:04,515 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-11 21:14:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689684845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:04,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-11 21:14:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780324352] [2024-10-11 21:14:04,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:04,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 21:14:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:04,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 21:14:04,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:14:04,517 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-11 21:14:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:04,579 INFO L93 Difference]: Finished difference Result 352 states and 483 transitions. [2024-10-11 21:14:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:14:04,579 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-11 21:14:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:04,581 INFO L225 Difference]: With dead ends: 352 [2024-10-11 21:14:04,581 INFO L226 Difference]: Without dead ends: 351 [2024-10-11 21:14:04,582 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-11 21:14:04,582 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:04,582 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.0s Time] [2024-10-11 21:14:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-11 21:14:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 331. [2024-10-11 21:14:04,596 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-11 21:14:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2024-10-11 21:14:04,599 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 91 [2024-10-11 21:14:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:04,599 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2024-10-11 21:14:04,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:14:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2024-10-11 21:14:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 21:14:04,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:04,601 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-11 21:14:04,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:14:04,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:04,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:04,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1453008131, now seen corresponding path program 1 times [2024-10-11 21:14:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110105364] [2024-10-11 21:14:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:05,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:14:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:05,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:14:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:14:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:05,174 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-11 21:14:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110105364] [2024-10-11 21:14:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110105364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445795299] [2024-10-11 21:14:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:05,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:05,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:05,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:14:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:05,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 21:14:05,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:05,345 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-11 21:14:05,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:05,614 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-11 21:14:05,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445795299] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:05,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 28 [2024-10-11 21:14:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374426411] [2024-10-11 21:14:05,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 21:14:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 21:14:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-10-11 21:14:05,616 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-11 21:14:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:06,282 INFO L93 Difference]: Finished difference Result 532 states and 737 transitions. [2024-10-11 21:14:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-11 21:14:06,283 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-11 21:14:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:06,284 INFO L225 Difference]: With dead ends: 532 [2024-10-11 21:14:06,284 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 21:14:06,288 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-11 21:14:06,288 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:06,289 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.3s Time] [2024-10-11 21:14:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 21:14:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 178. [2024-10-11 21:14:06,296 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-11 21:14:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-10-11 21:14:06,297 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 92 [2024-10-11 21:14:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-10-11 21:14:06,308 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-11 21:14:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-10-11 21:14:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 21:14:06,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:06,308 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:14:06,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:14:06,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 21:14:06,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1790678057, now seen corresponding path program 2 times [2024-10-11 21:14:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967106899] [2024-10-11 21:14:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:06,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:14:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 21:14:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:06,660 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-11 21:14:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967106899] [2024-10-11 21:14:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967106899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354206706] [2024-10-11 21:14:06,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:14:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:06,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:06,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:14:06,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:14:06,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:06,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:14:06,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:06,758 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-11 21:14:06,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:06,884 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-11 21:14:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354206706] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:06,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-10-11 21:14:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904493936] [2024-10-11 21:14:06,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:06,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 21:14:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 21:14:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 21:14:06,886 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-11 21:14:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:06,940 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-10-11 21:14:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 21:14:06,940 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-11 21:14:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:06,941 INFO L225 Difference]: With dead ends: 179 [2024-10-11 21:14:06,941 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 21:14:06,942 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-11 21:14:06,942 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-11 21:14:06,942 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-11 21:14:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 21:14:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-10-11 21:14:06,948 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-11 21:14:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-10-11 21:14:06,950 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 86 [2024-10-11 21:14:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:06,950 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-10-11 21:14:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:14:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-10-11 21:14:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 21:14:06,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:06,951 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-11 21:14:06,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:14:07,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:07,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:07,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1426265217, now seen corresponding path program 3 times [2024-10-11 21:14:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122576737] [2024-10-11 21:14:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 21:14:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 21:14:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:07,398 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-11 21:14:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122576737] [2024-10-11 21:14:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122576737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252578844] [2024-10-11 21:14:07,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:14:07,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:07,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:07,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:07,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:14:07,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 21:14:07,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:07,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:14:07,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:07,494 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-11 21:14:07,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:07,657 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-11 21:14:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252578844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:07,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:07,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-10-11 21:14:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699662243] [2024-10-11 21:14:07,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:07,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 21:14:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:07,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 21:14:07,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:14:07,659 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-11 21:14:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:07,726 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2024-10-11 21:14:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:14:07,727 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-11 21:14:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:07,728 INFO L225 Difference]: With dead ends: 178 [2024-10-11 21:14:07,728 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 21:14:07,728 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-11 21:14:07,729 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:07,729 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.0s Time] [2024-10-11 21:14:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 21:14:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-11 21:14:07,737 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-11 21:14:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 194 transitions. [2024-10-11 21:14:07,738 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 194 transitions. Word has length 118 [2024-10-11 21:14:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:07,739 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 194 transitions. [2024-10-11 21:14:07,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 21:14:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 194 transitions. [2024-10-11 21:14:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 21:14:07,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:07,742 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-11 21:14:07,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 21:14:07,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:14:07,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1914996354, now seen corresponding path program 3 times [2024-10-11 21:14:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605057148] [2024-10-11 21:14:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:14:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 21:14:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:08,504 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-11 21:14:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605057148] [2024-10-11 21:14:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605057148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562554382] [2024-10-11 21:14:08,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:14:08,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:08,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:08,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:08,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:14:08,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 21:14:08,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:08,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 21:14:08,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:08,742 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-11 21:14:08,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:09,713 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-11 21:14:09,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562554382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:09,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2024-10-11 21:14:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563850154] [2024-10-11 21:14:09,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:09,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 21:14:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 21:14:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:14:09,715 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-11 21:14:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:09,777 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2024-10-11 21:14:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 21:14:09,778 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-11 21:14:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:09,779 INFO L225 Difference]: With dead ends: 178 [2024-10-11 21:14:09,779 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 21:14:09,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 358 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2024-10-11 21:14:09,779 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-11 21:14:09,780 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-11 21:14:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 21:14:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-11 21:14:09,787 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-11 21:14:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2024-10-11 21:14:09,788 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 172 [2024-10-11 21:14:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:09,788 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2024-10-11 21:14:09,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 21:14:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2024-10-11 21:14:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-10-11 21:14:09,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:09,792 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-11 21:14:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 21:14:09,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:09,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:09,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1438043800, now seen corresponding path program 4 times [2024-10-11 21:14:09,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:09,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257289772] [2024-10-11 21:14:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 21:14:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:14:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-11 21:14:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:12,330 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-11 21:14:12,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:12,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257289772] [2024-10-11 21:14:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257289772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889630487] [2024-10-11 21:14:12,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 21:14:12,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:12,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:12,334 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:12,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:14:12,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 21:14:12,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:12,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-11 21:14:12,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:12,865 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-11 21:14:12,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:14:18,213 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-11 21:14:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889630487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:14:18,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:14:18,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2024-10-11 21:14:18,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951623229] [2024-10-11 21:14:18,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:14:18,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 21:14:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 21:14:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 21:14:18,217 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-11 21:14:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:18,297 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2024-10-11 21:14:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 21:14:18,298 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-11 21:14:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:18,299 INFO L225 Difference]: With dead ends: 178 [2024-10-11 21:14:18,299 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 21:14:18,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 888 SyntacticMatches, 62 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 21:14:18,302 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-11 21:14:18,302 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-11 21:14:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 21:14:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-11 21:14:18,308 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-11 21:14:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2024-10-11 21:14:18,309 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 415 [2024-10-11 21:14:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:18,310 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2024-10-11 21:14:18,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:14:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2024-10-11 21:14:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2024-10-11 21:14:18,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:18,327 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-11 21:14:18,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 21:14:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 21:14:18,528 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:14:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1534660571, now seen corresponding path program 5 times [2024-10-11 21:14:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982183146] [2024-10-11 21:14:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:14:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:14:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:14:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-10-11 21:14:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:14:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2024-10-11 21:14:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 21:14:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:14:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:14:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:14:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:14:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 21:14:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:14:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:29,599 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-11 21:14:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982183146] [2024-10-11 21:14:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982183146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665563254] [2024-10-11 21:14:29,599 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 21:14:29,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:29,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:29,602 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:14:29,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:14:29,996 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2024-10-11 21:14:29,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:30,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 1998 conjuncts, 217 conjuncts are in the unsatisfiable core [2024-10-11 21:14:30,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:30,704 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-11 21:14:30,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:05,892 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-11 21:15:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665563254] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:05,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:05,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2024-10-11 21:15:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984312139] [2024-10-11 21:15:05,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:05,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 21:15:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 21:15:05,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 21:15:05,896 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-11 21:15:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:05,997 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2024-10-11 21:15:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 21:15:05,997 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-11 21:15:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:06,000 INFO L225 Difference]: With dead ends: 177 [2024-10-11 21:15:06,000 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:15:06,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2572 GetRequests, 2326 SyntacticMatches, 192 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7409 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=660, Invalid=2420, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 21:15:06,002 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-11 21:15:06,002 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-11 21:15:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:15:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:15:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:15:06,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1070 [2024-10-11 21:15:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:06,006 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:15:06,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 55 states have internal predecessors, (138), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2024-10-11 21:15:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:15:06,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:15:06,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 21:15:06,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 21:15:06,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 21:15:06,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 21:15:06,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 21:15:06,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 21:15:06,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 21:15:06,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 21:15:06,214 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 21:15:06,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:15:07,202 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:15:07,235 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 21:15:07,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:15:07 BoogieIcfgContainer [2024-10-11 21:15:07,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:15:07,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:15:07,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:15:07,241 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:15:07,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:13:58" (3/4) ... [2024-10-11 21:15:07,245 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:15:07,248 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2024-10-11 21:15:07,251 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:15:07,251 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:15:07,251 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:15:07,251 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:15:07,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:15:07,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:15:07,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:15:07,325 INFO L158 Benchmark]: Toolchain (without parser) took 69708.22ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 57.6MB in the beginning and 932.4MB in the end (delta: -874.8MB). Peak memory consumption was 316.7MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,325 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 125.8MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:15:07,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.35ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 57.4MB in the beginning and 137.3MB in the end (delta: -79.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.56ms. Allocated memory is still 167.8MB. Free memory was 137.3MB in the beginning and 136.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,326 INFO L158 Benchmark]: Boogie Preprocessor took 25.71ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,326 INFO L158 Benchmark]: RCFGBuilder took 310.43ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 122.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,327 INFO L158 Benchmark]: TraceAbstraction took 69018.80ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 121.6MB in the beginning and 937.6MB in the end (delta: -816.1MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,327 INFO L158 Benchmark]: Witness Printer took 84.41ms. Allocated memory is still 1.3GB. Free memory was 936.6MB in the beginning and 932.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:15:07,328 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.80ms. Allocated memory is still 125.8MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.35ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 57.4MB in the beginning and 137.3MB in the end (delta: -79.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.56ms. Allocated memory is still 167.8MB. Free memory was 137.3MB in the beginning and 136.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.71ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.43ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 122.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 69018.80ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 121.6MB in the beginning and 937.6MB in the end (delta: -816.1MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. * Witness Printer took 84.41ms. Allocated memory is still 1.3GB. Free memory was 936.6MB in the beginning and 932.4MB 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: 67.9s, OverallIterations: 15, TraceHistogramMax: 110, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, 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.7s 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.2s 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 60.4s 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-11 21:15:07,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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