./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_2calls_2-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_2calls_2-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 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:13:58,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:13:58,731 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:58,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:13:58,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:13:58,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:13:58,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:13:58,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:13:58,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:13:58,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:13:58,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:13:58,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:13:58,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:13:58,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:13:58,762 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:13:58,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:13:58,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:13:58,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:13:58,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:13:58,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:13:58,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:13:58,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:13:58,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:13:58,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:13:58,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:13:58,766 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:13:58,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:13:58,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:13:58,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:13:58,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:13:58,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:13:58,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:13:58,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:13:58,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:13:58,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:13:58,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:13:58,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:13:58,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:13:58,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:13:58,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:13:58,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:13:58,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:13:58,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:13:58,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:13:58,772 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 -> 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 [2024-10-11 21:13:59,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:13:59,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:13:59,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:13:59,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:13:59,080 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:13:59,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2024-10-11 21:14:00,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:14:00,790 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:14:00,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2024-10-11 21:14:00,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c616ea0be/0be26314dd104a25846c0d1c3605f399/FLAG2b15b8065 [2024-10-11 21:14:00,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c616ea0be/0be26314dd104a25846c0d1c3605f399 [2024-10-11 21:14:00,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:14:00,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:14:00,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:14:00,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:14:00,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:14:00,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:14:00" (1/1) ... [2024-10-11 21:14:00,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d77887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:00, skipping insertion in model container [2024-10-11 21:14:00,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:14:00" (1/1) ... [2024-10-11 21:14:00,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:14:01,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:14:01,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:14:01,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:14:01,100 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:14:01,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01 WrapperNode [2024-10-11 21:14:01,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:14:01,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:14:01,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:14:01,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:14:01,109 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:14:01" (1/1) ... [2024-10-11 21:14:01,116 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:14:01" (1/1) ... [2024-10-11 21:14:01,132 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2024-10-11 21:14:01,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:14:01,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:14:01,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:14:01,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:14:01,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,157 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:14:01,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:14:01,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:14:01,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:14:01,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:14:01,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (1/1) ... [2024-10-11 21:14:01,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:14:01,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:01,212 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:14:01,219 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:14:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:14:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:14:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-10-11 21:14:01,267 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-10-11 21:14:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-10-11 21:14:01,268 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-10-11 21:14:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:14:01,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:14:01,336 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:14:01,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:14:01,537 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 21:14:01,537 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:14:01,574 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:14:01,574 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:14:01,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:14:01 BoogieIcfgContainer [2024-10-11 21:14:01,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:14:01,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:14:01,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:14:01,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:14:01,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:14:00" (1/3) ... [2024-10-11 21:14:01,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2720b209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:14:01, skipping insertion in model container [2024-10-11 21:14:01,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:14:01" (2/3) ... [2024-10-11 21:14:01,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2720b209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:14:01, skipping insertion in model container [2024-10-11 21:14:01,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:14:01" (3/3) ... [2024-10-11 21:14:01,588 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2024-10-11 21:14:01,608 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:14:01,608 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 21:14:01,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:14:01,687 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;@338f4c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:14:01,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 21:14:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:14:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:14:01,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:01,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:14:01,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1021543012, now seen corresponding path program 1 times [2024-10-11 21:14:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009288116] [2024-10-11 21:14:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:01,918 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:14:01,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009288116] [2024-10-11 21:14:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009288116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:01,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:01,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:14:01,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474510910] [2024-10-11 21:14:01,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:01,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:14:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:01,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:14:01,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:14:01,969 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 3 states have (on average 1.6666666666666667) 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:14:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:02,131 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-10-11 21:14:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:14:02,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) 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:14:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:02,141 INFO L225 Difference]: With dead ends: 75 [2024-10-11 21:14:02,142 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 21:14:02,144 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:14:02,150 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:02,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 173 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:14:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 21:14:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-11 21:14:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 47 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:14:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-10-11 21:14:02,200 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 6 [2024-10-11 21:14:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-10-11 21:14:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) 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:14:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-10-11 21:14:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 21:14:02,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:02,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:14:02,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1070030294, now seen corresponding path program 1 times [2024-10-11 21:14:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172786224] [2024-10-11 21:14:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,279 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:14:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172786224] [2024-10-11 21:14:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172786224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:02,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:02,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:14:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3959712] [2024-10-11 21:14:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:02,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:14:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:02,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:14:02,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:14:02,285 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:02,327 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-10-11 21:14:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:14:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 21:14:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:02,331 INFO L225 Difference]: With dead ends: 59 [2024-10-11 21:14:02,331 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 21:14:02,331 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:14:02,333 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:02,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 21:14:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-11 21:14:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 45 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:14:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-10-11 21:14:02,350 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 12 [2024-10-11 21:14:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:02,350 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-11 21:14:02,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-10-11 21:14:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 21:14:02,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:02,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:02,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:14:02,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:02,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1188799193, now seen corresponding path program 1 times [2024-10-11 21:14:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:02,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674095785] [2024-10-11 21:14:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,482 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:14:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674095785] [2024-10-11 21:14:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674095785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:14:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12548339] [2024-10-11 21:14:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:14:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:14:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:14:02,490 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:02,659 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-10-11 21:14:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:14:02,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 21:14:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:02,661 INFO L225 Difference]: With dead ends: 78 [2024-10-11 21:14:02,661 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 21:14:02,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:14:02,663 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:02,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 183 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:14:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 21:14:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-10-11 21:14:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 57 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:14:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-10-11 21:14:02,676 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 13 [2024-10-11 21:14:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:02,681 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-10-11 21:14:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-10-11 21:14:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 21:14:02,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:02,682 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:02,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:14:02,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:02,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1483309798, now seen corresponding path program 1 times [2024-10-11 21:14:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322199397] [2024-10-11 21:14:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:14:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322199397] [2024-10-11 21:14:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322199397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:02,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:02,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:14:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294008187] [2024-10-11 21:14:02,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:02,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:14:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:14:02,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:14:02,739 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:02,769 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-10-11 21:14:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:14:02,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 21:14:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:02,771 INFO L225 Difference]: With dead ends: 72 [2024-10-11 21:14:02,771 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 21:14:02,772 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:14:02,773 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:02,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 21:14:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-10-11 21:14:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 55 states have internal predecessors, (65), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:14:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2024-10-11 21:14:02,795 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2024-10-11 21:14:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2024-10-11 21:14:02,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2024-10-11 21:14:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 21:14:02,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:02,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:02,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:14:02,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1262036431, now seen corresponding path program 1 times [2024-10-11 21:14:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327244877] [2024-10-11 21:14:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:14:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327244877] [2024-10-11 21:14:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327244877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:14:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183308388] [2024-10-11 21:14:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:02,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:14:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:02,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:14:02,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:14:02,966 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:03,049 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2024-10-11 21:14:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:14:03,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 21:14:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:03,050 INFO L225 Difference]: With dead ends: 82 [2024-10-11 21:14:03,050 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 21:14:03,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:14:03,052 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:03,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 21:14:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 21:14:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 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:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-11 21:14:03,064 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2024-10-11 21:14:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:03,066 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-11 21:14:03,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:14:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-11 21:14:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 21:14:03,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:03,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:14:03,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1317113808, now seen corresponding path program 1 times [2024-10-11 21:14:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130643356] [2024-10-11 21:14:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:14:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:14:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:14:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130643356] [2024-10-11 21:14:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130643356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:03,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:14:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604163559] [2024-10-11 21:14:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:03,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:14:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:03,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:14:03,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:14:03,187 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:03,217 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-11 21:14:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:14:03,218 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 22 [2024-10-11 21:14:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:03,219 INFO L225 Difference]: With dead ends: 36 [2024-10-11 21:14:03,219 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 21:14:03,220 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:03,220 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:03,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 21:14:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-11 21:14:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 21:14:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-11 21:14:03,226 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2024-10-11 21:14:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:03,227 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-11 21:14:03,227 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:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-11 21:14:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 21:14:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:03,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:03,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:14:03,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2108197165, now seen corresponding path program 1 times [2024-10-11 21:14:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684364408] [2024-10-11 21:14:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:14:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:14:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:14:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684364408] [2024-10-11 21:14:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684364408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129807032] [2024-10-11 21:14:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:03,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:03,380 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:14:03,382 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:14:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:14:03,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:14:03,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:14:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129807032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:14:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2024-10-11 21:14:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173890897] [2024-10-11 21:14:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:03,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:14:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:14:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:14:03,553 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:03,637 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-10-11 21:14:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:14:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 21:14:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:03,638 INFO L225 Difference]: With dead ends: 40 [2024-10-11 21:14:03,639 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 21:14:03,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:14:03,640 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:03,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:14:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 21:14:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 21:14:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:14:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-11 21:14:03,656 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2024-10-11 21:14:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:03,657 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-11 21:14:03,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-11 21:14:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 21:14:03,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:03,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:03,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:14:03,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:03,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1981525409, now seen corresponding path program 2 times [2024-10-11 21:14:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660463772] [2024-10-11 21:14:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:14:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:14:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:14:03,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:03,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660463772] [2024-10-11 21:14:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660463772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:03,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954616008] [2024-10-11 21:14:03,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:14:03,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:03,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:03,966 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:03,967 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:04,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:14:04,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:14:04,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:14:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:14:04,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:14:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954616008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:14:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 21:14:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29893474] [2024-10-11 21:14:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:04,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:14:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:14:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:14:04,070 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:04,090 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-11 21:14:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:14:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 21:14:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:04,092 INFO L225 Difference]: With dead ends: 24 [2024-10-11 21:14:04,092 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 21:14:04,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 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:04,093 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:04,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 21:14:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 21:14:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:14:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-11 21:14:04,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 23 [2024-10-11 21:14:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:04,105 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-11 21:14:04,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-11 21:14:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 21:14:04,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:04,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:04,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:14:04,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:04,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:04,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1297745634, now seen corresponding path program 1 times [2024-10-11 21:14:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175363107] [2024-10-11 21:14:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:14:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:14:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:14:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:04,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175363107] [2024-10-11 21:14:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175363107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:14:04,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207333519] [2024-10-11 21:14:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:14:04,440 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:04,441 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:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:14:04,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:14:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:14:04,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:14:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207333519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:04,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:14:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:14:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435192962] [2024-10-11 21:14:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:04,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:14:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:14:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:14:04,554 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:04,578 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-10-11 21:14:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:14:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-10-11 21:14:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:04,579 INFO L225 Difference]: With dead ends: 27 [2024-10-11 21:14:04,579 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 21:14:04,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:14:04,580 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:04,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 21:14:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 21:14:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 2 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:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-10-11 21:14:04,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 24 [2024-10-11 21:14:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:04,587 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-10-11 21:14:04,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-10-11 21:14:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 21:14:04,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:14:04,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:04,606 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:04,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:14:04,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 21:14:04,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:14:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1914786177, now seen corresponding path program 1 times [2024-10-11 21:14:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:14:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56968224] [2024-10-11 21:14:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:14:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:14:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:14:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 21:14:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:14:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 21:14:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:14:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56968224] [2024-10-11 21:14:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56968224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:14:04,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:14:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:14:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275935962] [2024-10-11 21:14:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:14:04,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:14:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:14:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:14:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:14:04,880 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:14:04,896 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-10-11 21:14:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:14:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-11 21:14:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:14:04,897 INFO L225 Difference]: With dead ends: 21 [2024-10-11 21:14:04,897 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:14:04,897 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:04,900 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:14:04,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:14:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:14:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:14:04,902 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:14:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:14:04,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-11 21:14:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:14:04,902 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:14:04,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:14:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:14:04,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:14:04,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-11 21:14:04,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-11 21:14:04,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-11 21:14:04,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-11 21:14:04,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-11 21:14:04,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:14:04,910 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:14:04,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:14:05,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:14:05,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:14:05 BoogieIcfgContainer [2024-10-11 21:14:05,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:14:05,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:14:05,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:14:05,039 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:14:05,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:14:01" (3/4) ... [2024-10-11 21:14:05,041 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:14:05,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2024-10-11 21:14:05,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2024-10-11 21:14:05,050 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:14:05,051 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:14:05,051 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:14:05,051 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:14:05,134 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:14:05,135 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:14:05,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:14:05,135 INFO L158 Benchmark]: Toolchain (without parser) took 4318.70ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 96.5MB in the beginning and 82.5MB in the end (delta: 14.0MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-10-11 21:14:05,135 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 151.0MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:14:05,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.98ms. Allocated memory is still 151.0MB. Free memory was 96.2MB in the beginning and 84.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:14:05,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.17ms. Allocated memory is still 151.0MB. Free memory was 84.3MB in the beginning and 83.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:14:05,136 INFO L158 Benchmark]: Boogie Preprocessor took 37.88ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 81.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:14:05,136 INFO L158 Benchmark]: RCFGBuilder took 400.53ms. Allocated memory is still 151.0MB. Free memory was 81.2MB in the beginning and 68.1MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 21:14:05,137 INFO L158 Benchmark]: TraceAbstraction took 3459.05ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 67.5MB in the beginning and 87.7MB in the end (delta: -20.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-10-11 21:14:05,137 INFO L158 Benchmark]: Witness Printer took 96.52ms. Allocated memory is still 195.0MB. Free memory was 87.7MB in the beginning and 82.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:14:05,138 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.99ms. Allocated memory is still 151.0MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.98ms. Allocated memory is still 151.0MB. Free memory was 96.2MB in the beginning and 84.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.17ms. Allocated memory is still 151.0MB. Free memory was 84.3MB in the beginning and 83.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.88ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 81.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.53ms. Allocated memory is still 151.0MB. Free memory was 81.2MB in the beginning and 68.1MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3459.05ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 67.5MB in the beginning and 87.7MB in the end (delta: -20.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 96.52ms. Allocated memory is still 195.0MB. Free memory was 87.7MB in the beginning and 82.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: 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 3 procedures, 48 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 776 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 530 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 246 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=3, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 1 NumberOfNonLiveVariables, 199 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 36/42 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 12 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Requires: (n <= 1) Ensures: (((\result == 1) || ((\result == 0) && (n <= 0))) && (n <= 1)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Requires: (2 == n) Ensures: (2 == n) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:14:05,163 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