./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 7e40a98558d0111ea95f3ee60a44cc14c7768182 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:10:19,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:10:19,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:10:19,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:10:19,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:10:19,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:10:19,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:10:19,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:10:19,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:10:19,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:10:19,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:10:19,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:10:19,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:10:19,228 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:10:19,229 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:10:19,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:10:19,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:10:19,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:10:19,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:10:19,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:10:19,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:10:19,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:10:19,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:10:19,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:10:19,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:10:19,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:10:19,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:10:19,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:10:19,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:10:19,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:10:19,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:10:19,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:10:19,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:10:19,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:10:19,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:10:19,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:10:19,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-28 23:10:19,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:10:19,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:10:19,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:10:19,284 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:10:19,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:10:19,287 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:10:19,288 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:10:19,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:10:19,288 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:10:19,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:10:19,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:10:19,288 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:10:19,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:10:19,289 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:10:19,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:10:19,289 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:10:19,289 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:10:19,289 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:10:19,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:10:19,291 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:10:19,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:10:19,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:10:19,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:10:19,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:10:19,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:10:19,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:10:19,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:10:19,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:10:19,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:10:19,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:10:19,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:10:19,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:10:19,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-11-28 23:10:19,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:10:19,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:10:19,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:10:19,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:10:19,373 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:10:19,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 23:10:19,440 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e9b655d/867a57af220b4818b4761db56ae0d56f/FLAG5caecf44b [2018-11-28 23:10:19,926 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:10:19,927 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 23:10:19,933 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e9b655d/867a57af220b4818b4761db56ae0d56f/FLAG5caecf44b [2018-11-28 23:10:20,299 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e9b655d/867a57af220b4818b4761db56ae0d56f [2018-11-28 23:10:20,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:10:20,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:10:20,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:10:20,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:10:20,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:10:20,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364f73cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20, skipping insertion in model container [2018-11-28 23:10:20,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:10:20,351 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:10:20,567 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:10:20,575 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:10:20,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:10:20,610 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:10:20,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20 WrapperNode [2018-11-28 23:10:20,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:10:20,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:10:20,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:10:20,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:10:20,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:10:20,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:10:20,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:10:20,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:10:20,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... [2018-11-28 23:10:20,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:10:20,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:10:20,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:10:20,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:10:20,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:10:20,800 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-28 23:10:20,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-28 23:10:20,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:10:20,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:10:20,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:10:20,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:10:20,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:10:20,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:10:21,127 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:10:21,128 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 23:10:21,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:21 BoogieIcfgContainer [2018-11-28 23:10:21,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:10:21,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:10:21,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:10:21,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:10:21,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:10:20" (1/3) ... [2018-11-28 23:10:21,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166aeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:10:21, skipping insertion in model container [2018-11-28 23:10:21,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:20" (2/3) ... [2018-11-28 23:10:21,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166aeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:10:21, skipping insertion in model container [2018-11-28 23:10:21,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:21" (3/3) ... [2018-11-28 23:10:21,143 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 23:10:21,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:10:21,176 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-28 23:10:21,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-28 23:10:21,237 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:10:21,238 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:10:21,238 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:10:21,239 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:10:21,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:10:21,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:10:21,242 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:10:21,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:10:21,243 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:10:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-28 23:10:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:10:21,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:21,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:21,288 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:21,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1707029017, now seen corresponding path program 1 times [2018-11-28 23:10:21,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:21,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:21,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:21,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:21,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:10:21,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:21,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:10:21,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:10:21,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:10:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:10:21,549 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-11-28 23:10:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:21,750 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-28 23:10:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:10:21,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-28 23:10:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:21,762 INFO L225 Difference]: With dead ends: 38 [2018-11-28 23:10:21,762 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:10:21,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:10:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:10:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 23:10:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:10:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-28 23:10:21,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2018-11-28 23:10:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:21,810 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-28 23:10:21,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:10:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-28 23:10:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:10:21,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:21,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:21,813 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:21,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1378291933, now seen corresponding path program 1 times [2018-11-28 23:10:21,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:21,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:21,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:21,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:10:21,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:21,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:10:21,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:10:21,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:10:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:10:21,847 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-28 23:10:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:21,903 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-28 23:10:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:10:21,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 23:10:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:21,906 INFO L225 Difference]: With dead ends: 27 [2018-11-28 23:10:21,906 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:10:21,907 INFO L631 BasicCegarLoop]: 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 [2018-11-28 23:10:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:10:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-28 23:10:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:10:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-28 23:10:21,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 11 [2018-11-28 23:10:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:21,917 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 23:10:21,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:10:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-28 23:10:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 23:10:21,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:21,918 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:21,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:21,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash -995069271, now seen corresponding path program 1 times [2018-11-28 23:10:21,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:21,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:21,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:21,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 23:10:22,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:22,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:22,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:22,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:10:22,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:22,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-11-28 23:10:22,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:10:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:10:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:10:22,561 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 11 states. [2018-11-28 23:10:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:23,464 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-11-28 23:10:23,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:10:23,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-28 23:10:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:23,467 INFO L225 Difference]: With dead ends: 78 [2018-11-28 23:10:23,468 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 23:10:23,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:10:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 23:10:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-28 23:10:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:10:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-28 23:10:23,486 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 32 [2018-11-28 23:10:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:23,487 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-28 23:10:23,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:10:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-28 23:10:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:10:23,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:23,492 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:23,492 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:23,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 131544367, now seen corresponding path program 1 times [2018-11-28 23:10:23,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:23,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:23,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 23:10:23,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:10:23,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:10:23,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:10:23,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:10:23,597 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 5 states. [2018-11-28 23:10:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:23,725 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2018-11-28 23:10:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:10:23,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-28 23:10:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:23,730 INFO L225 Difference]: With dead ends: 78 [2018-11-28 23:10:23,730 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 23:10:23,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:10:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 23:10:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2018-11-28 23:10:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 23:10:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2018-11-28 23:10:23,757 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 34 [2018-11-28 23:10:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:23,758 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2018-11-28 23:10:23,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:10:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-28 23:10:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 23:10:23,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:23,761 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:23,761 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:23,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash -217091865, now seen corresponding path program 1 times [2018-11-28 23:10:23,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:23,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:23,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:23,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 23:10:23,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:23,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:23,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:23,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:10:24,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:24,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 12 [2018-11-28 23:10:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:10:24,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:10:24,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:10:24,113 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 12 states. [2018-11-28 23:10:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:25,235 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2018-11-28 23:10:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:10:25,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-28 23:10:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:25,238 INFO L225 Difference]: With dead ends: 115 [2018-11-28 23:10:25,238 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 23:10:25,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:10:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 23:10:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-11-28 23:10:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 23:10:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-11-28 23:10:25,251 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 35 [2018-11-28 23:10:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:25,251 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2018-11-28 23:10:25,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:10:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2018-11-28 23:10:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 23:10:25,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:25,255 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:25,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:25,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1616531980, now seen corresponding path program 1 times [2018-11-28 23:10:25,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:25,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:25,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-28 23:10:25,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:25,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:25,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:25,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 58 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 23:10:25,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:25,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 16 [2018-11-28 23:10:25,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 23:10:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:10:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:10:25,613 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 16 states. [2018-11-28 23:10:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:26,389 INFO L93 Difference]: Finished difference Result 153 states and 203 transitions. [2018-11-28 23:10:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 23:10:26,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-11-28 23:10:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:26,391 INFO L225 Difference]: With dead ends: 153 [2018-11-28 23:10:26,391 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 23:10:26,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-28 23:10:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 23:10:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-11-28 23:10:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 23:10:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-11-28 23:10:26,409 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 65 [2018-11-28 23:10:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:26,410 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-11-28 23:10:26,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 23:10:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-11-28 23:10:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 23:10:26,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:26,413 INFO L402 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:26,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:26,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2014803044, now seen corresponding path program 2 times [2018-11-28 23:10:26,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:26,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:26,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-28 23:10:26,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:26,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:10:26,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:10:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:10:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:10:26,508 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 5 states. [2018-11-28 23:10:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:26,555 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-11-28 23:10:26,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:10:26,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 23:10:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:26,569 INFO L225 Difference]: With dead ends: 101 [2018-11-28 23:10:26,569 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 23:10:26,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:10:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 23:10:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-28 23:10:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 23:10:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2018-11-28 23:10:26,615 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 76 [2018-11-28 23:10:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:26,616 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2018-11-28 23:10:26,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:10:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2018-11-28 23:10:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 23:10:26,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:26,624 INFO L402 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:26,624 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:26,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:26,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1965615022, now seen corresponding path program 1 times [2018-11-28 23:10:26,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:26,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:26,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:26,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-28 23:10:26,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:26,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:10:26,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:10:26,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:10:26,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:10:26,773 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 5 states. [2018-11-28 23:10:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:26,830 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2018-11-28 23:10:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:10:26,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-28 23:10:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:26,838 INFO L225 Difference]: With dead ends: 104 [2018-11-28 23:10:26,838 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 23:10:26,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:10:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 23:10:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-28 23:10:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 23:10:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-11-28 23:10:26,862 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 77 [2018-11-28 23:10:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:26,862 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-28 23:10:26,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:10:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-28 23:10:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 23:10:26,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:26,872 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:26,872 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:26,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1954123448, now seen corresponding path program 3 times [2018-11-28 23:10:26,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:26,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-28 23:10:27,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:27,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:27,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:10:27,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 23:10:27,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:27,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-28 23:10:27,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:27,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 23:10:27,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:10:27,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:10:27,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:10:27,172 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 9 states. [2018-11-28 23:10:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:27,332 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2018-11-28 23:10:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:10:27,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-11-28 23:10:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:27,336 INFO L225 Difference]: With dead ends: 135 [2018-11-28 23:10:27,336 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 23:10:27,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:10:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 23:10:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-11-28 23:10:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 23:10:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 150 transitions. [2018-11-28 23:10:27,351 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 150 transitions. Word has length 77 [2018-11-28 23:10:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:27,351 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 150 transitions. [2018-11-28 23:10:27,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:10:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 150 transitions. [2018-11-28 23:10:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-28 23:10:27,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:27,354 INFO L402 BasicCegarLoop]: trace histogram [17, 14, 11, 10, 10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:27,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:27,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash 13910596, now seen corresponding path program 4 times [2018-11-28 23:10:27,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:27,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:27,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:27,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:27,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 123 proven. 200 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 23:10:27,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:27,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:27,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:10:27,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:10:27,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:27,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 346 proven. 121 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-11-28 23:10:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 20 [2018-11-28 23:10:28,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 23:10:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 23:10:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:10:28,087 INFO L87 Difference]: Start difference. First operand 120 states and 150 transitions. Second operand 20 states. [2018-11-28 23:10:28,390 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-28 23:10:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:29,393 INFO L93 Difference]: Finished difference Result 253 states and 335 transitions. [2018-11-28 23:10:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 23:10:29,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 144 [2018-11-28 23:10:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:29,397 INFO L225 Difference]: With dead ends: 253 [2018-11-28 23:10:29,397 INFO L226 Difference]: Without dead ends: 151 [2018-11-28 23:10:29,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-11-28 23:10:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-28 23:10:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 138. [2018-11-28 23:10:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-28 23:10:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2018-11-28 23:10:29,412 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 144 [2018-11-28 23:10:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:29,413 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2018-11-28 23:10:29,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 23:10:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2018-11-28 23:10:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 23:10:29,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:29,415 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:29,415 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:29,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1659895493, now seen corresponding path program 5 times [2018-11-28 23:10:29,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:29,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:29,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:29,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 105 proven. 34 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-28 23:10:29,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:29,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:29,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:10:29,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-28 23:10:29,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:29,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 114 proven. 37 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-28 23:10:29,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:29,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2018-11-28 23:10:29,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:10:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:10:29,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:10:29,861 INFO L87 Difference]: Start difference. First operand 138 states and 173 transitions. Second operand 12 states. [2018-11-28 23:10:30,503 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-28 23:10:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:30,812 INFO L93 Difference]: Finished difference Result 259 states and 338 transitions. [2018-11-28 23:10:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:10:30,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2018-11-28 23:10:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:30,817 INFO L225 Difference]: With dead ends: 259 [2018-11-28 23:10:30,817 INFO L226 Difference]: Without dead ends: 139 [2018-11-28 23:10:30,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-28 23:10:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-28 23:10:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-11-28 23:10:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 23:10:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2018-11-28 23:10:30,831 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 97 [2018-11-28 23:10:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:30,832 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2018-11-28 23:10:30,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:10:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2018-11-28 23:10:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 23:10:30,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:30,836 INFO L402 BasicCegarLoop]: trace histogram [15, 13, 10, 10, 10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:30,836 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:30,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1348864486, now seen corresponding path program 6 times [2018-11-28 23:10:30,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:30,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:30,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 158 proven. 281 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-28 23:10:31,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:31,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:10:31,599 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-28 23:10:31,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:31,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 202 proven. 226 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-28 23:10:31,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:31,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 24 [2018-11-28 23:10:31,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 23:10:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 23:10:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-11-28 23:10:31,678 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 24 states. [2018-11-28 23:10:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:33,560 INFO L93 Difference]: Finished difference Result 279 states and 322 transitions. [2018-11-28 23:10:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-28 23:10:33,561 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 122 [2018-11-28 23:10:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:33,562 INFO L225 Difference]: With dead ends: 279 [2018-11-28 23:10:33,563 INFO L226 Difference]: Without dead ends: 151 [2018-11-28 23:10:33,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=891, Invalid=2415, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 23:10:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-28 23:10:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2018-11-28 23:10:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 23:10:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-11-28 23:10:33,574 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 122 [2018-11-28 23:10:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:33,575 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-11-28 23:10:33,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 23:10:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-11-28 23:10:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-28 23:10:33,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:33,576 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:33,576 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:33,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:33,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1128501564, now seen corresponding path program 7 times [2018-11-28 23:10:33,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:33,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:33,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-11-28 23:10:33,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:33,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:33,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-11-28 23:10:34,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:34,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 23:10:34,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:10:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:10:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:10:34,020 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 13 states. [2018-11-28 23:10:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:34,082 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2018-11-28 23:10:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:10:34,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-11-28 23:10:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:34,085 INFO L225 Difference]: With dead ends: 134 [2018-11-28 23:10:34,085 INFO L226 Difference]: Without dead ends: 133 [2018-11-28 23:10:34,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:10:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-28 23:10:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-28 23:10:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 23:10:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2018-11-28 23:10:34,094 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 116 [2018-11-28 23:10:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:34,094 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2018-11-28 23:10:34,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:10:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2018-11-28 23:10:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-28 23:10:34,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:34,099 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:34,099 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:34,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -623810062, now seen corresponding path program 2 times [2018-11-28 23:10:34,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:34,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-11-28 23:10:34,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:34,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:10:34,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:10:34,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:34,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 26 proven. 56 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2018-11-28 23:10:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-11-28 23:10:34,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:10:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:10:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:10:34,421 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand 13 states. [2018-11-28 23:10:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:34,514 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2018-11-28 23:10:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:10:34,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-11-28 23:10:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:34,517 INFO L225 Difference]: With dead ends: 132 [2018-11-28 23:10:34,517 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 23:10:34,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:10:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 23:10:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 23:10:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:10:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-11-28 23:10:34,527 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 117 [2018-11-28 23:10:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:34,528 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-11-28 23:10:34,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:10:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-11-28 23:10:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-28 23:10:34,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:34,530 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:34,531 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:34,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1226786477, now seen corresponding path program 8 times [2018-11-28 23:10:34,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:34,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:34,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:34,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-28 23:10:34,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:34,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:10:34,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:10:34,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:34,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-28 23:10:35,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:35,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-11-28 23:10:35,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 23:10:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 23:10:35,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:10:35,013 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 17 states. [2018-11-28 23:10:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:35,105 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-11-28 23:10:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:10:35,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 169 [2018-11-28 23:10:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:35,109 INFO L225 Difference]: With dead ends: 131 [2018-11-28 23:10:35,109 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 23:10:35,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:10:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 23:10:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 23:10:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:10:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-11-28 23:10:35,124 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 169 [2018-11-28 23:10:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:35,125 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-11-28 23:10:35,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 23:10:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-11-28 23:10:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-28 23:10:35,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:35,129 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 23, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 11, 11, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:35,129 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:35,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash -333231388, now seen corresponding path program 9 times [2018-11-28 23:10:35,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:35,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:35,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-11-28 23:10:35,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:35,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:35,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:10:35,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-28 23:10:35,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:35,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-11-28 23:10:36,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:36,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-11-28 23:10:36,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 23:10:36,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 23:10:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:10:36,030 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 21 states. [2018-11-28 23:10:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:36,164 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-11-28 23:10:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 23:10:36,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 261 [2018-11-28 23:10:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:36,167 INFO L225 Difference]: With dead ends: 131 [2018-11-28 23:10:36,167 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 23:10:36,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:10:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 23:10:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 23:10:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:10:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-11-28 23:10:36,176 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 261 [2018-11-28 23:10:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:36,177 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-11-28 23:10:36,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 23:10:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-11-28 23:10:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-11-28 23:10:36,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:36,180 INFO L402 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:36,180 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:36,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1881532310, now seen corresponding path program 10 times [2018-11-28 23:10:36,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:36,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:36,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:36,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2018-11-28 23:10:37,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:37,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:10:37,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:10:37,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:37,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2018-11-28 23:10:37,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:37,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2018-11-28 23:10:37,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 23:10:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 23:10:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2018-11-28 23:10:37,896 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 25 states. [2018-11-28 23:10:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:38,025 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-11-28 23:10:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 23:10:38,026 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 412 [2018-11-28 23:10:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:38,028 INFO L225 Difference]: With dead ends: 131 [2018-11-28 23:10:38,029 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 23:10:38,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2018-11-28 23:10:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 23:10:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 23:10:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:10:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-11-28 23:10:38,044 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 412 [2018-11-28 23:10:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:38,045 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-11-28 23:10:38,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 23:10:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-11-28 23:10:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-11-28 23:10:38,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:38,054 INFO L402 BasicCegarLoop]: trace histogram [68, 66, 55, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 32, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:38,055 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:38,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash 355145621, now seen corresponding path program 11 times [2018-11-28 23:10:38,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:38,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:38,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2018-11-28 23:10:39,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:39,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:39,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:10:39,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-28 23:10:39,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:39,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2018-11-28 23:10:39,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:39,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2018-11-28 23:10:39,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 23:10:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 23:10:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:10:39,869 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 29 states. [2018-11-28 23:10:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:40,044 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-11-28 23:10:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 23:10:40,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 661 [2018-11-28 23:10:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:40,048 INFO L225 Difference]: With dead ends: 131 [2018-11-28 23:10:40,048 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 23:10:40,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:10:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 23:10:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 23:10:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:10:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-11-28 23:10:40,059 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 661 [2018-11-28 23:10:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:40,061 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-11-28 23:10:40,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 23:10:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-11-28 23:10:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-11-28 23:10:40,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:40,073 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:40,073 INFO L423 AbstractCegarLoop]: === Iteration 19 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:40,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash -642383590, now seen corresponding path program 12 times [2018-11-28 23:10:40,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:40,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:40,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:40,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:10:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2018-11-28 23:10:41,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:41,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:10:41,476 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:10:42,311 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2018-11-28 23:10:42,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:10:42,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2018-11-28 23:10:44,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:10:44,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 32 [2018-11-28 23:10:44,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 23:10:44,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 23:10:44,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 23:10:44,747 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 33 states. [2018-11-28 23:10:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:44,922 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-11-28 23:10:44,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 23:10:44,923 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1067 [2018-11-28 23:10:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:44,927 INFO L225 Difference]: With dead ends: 130 [2018-11-28 23:10:44,927 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:10:44,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1283 GetRequests, 1252 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 23:10:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:10:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:10:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:10:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:10:44,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1067 [2018-11-28 23:10:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:44,930 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:10:44,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 23:10:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:10:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:10:44,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:10:46,231 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 123 DAG size of output: 73 [2018-11-28 23:10:46,996 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 13 [2018-11-28 23:10:46,999 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-11-28 23:10:46,999 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-11-28 23:10:46,999 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-11-28 23:10:46,999 INFO L448 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,000 INFO L448 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,000 INFO L448 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,000 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-11-28 23:10:47,000 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-11-28 23:10:47,000 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,000 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,000 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (< 1 |fibonacci_#in~n|) (or (and (<= |fibonacci_#in~n| fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) (< 9 |fibonacci_#in~n|))) [2018-11-28 23:10:47,001 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,001 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,001 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,001 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse1 (< 9 |fibonacci_#in~n|)) (.cse3 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse2 (<= 2 |fibonacci_#t~ret0|)) (.cse0 (<= fibonacci_~n |fibonacci_#in~n|))) (and (or (and (<= |fibonacci_#t~ret0| 1) (<= 2 fibonacci_~n) .cse0) (< 3 |fibonacci_#in~n|)) (or (<= 1 |fibonacci_#t~ret0|) .cse1) (or (or (< |fibonacci_#in~n| 6) (< 6 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 5) (<= 6 fibonacci_~n) .cse2 .cse0)) (or (and (<= |fibonacci_#t~ret0| 3) .cse2 (<= 5 fibonacci_~n) .cse0) (or (< |fibonacci_#in~n| 5) (< 5 |fibonacci_#in~n|))) (or (and (<= |fibonacci_#t~ret0| 8) .cse3 .cse2 .cse0) (or (< |fibonacci_#in~n| 7) (< 7 |fibonacci_#in~n|))) (or (< |fibonacci_#in~n| 9) (and (<= |fibonacci_#t~ret0| 21) .cse3 .cse2 .cse0) .cse1) (or (and .cse3 (<= |fibonacci_#t~ret0| 2) .cse2 .cse0) (and .cse3 (<= fibonacci_~n 3)) (< 4 |fibonacci_#in~n|)) (or (< |fibonacci_#in~n| 8) (and (<= |fibonacci_#t~ret0| 13) .cse3 .cse2 .cse0) (< 8 |fibonacci_#in~n|)))) [2018-11-28 23:10:47,001 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,001 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,001 INFO L448 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,002 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,002 INFO L448 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,002 INFO L448 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:10:47,002 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:10:47,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:10:47,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:10:47,002 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:10:47,002 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:10:47,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:10:47,003 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-28 23:10:47,003 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 25 33) the Hoare annotation is: true [2018-11-28 23:10:47,003 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 25 33) no Hoare annotation was computed. [2018-11-28 23:10:47,003 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-11-28 23:10:47,003 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 9 main_~x~0) (<= main_~x~0 9)) [2018-11-28 23:10:47,003 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-28 23:10:47,003 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 25 33) no Hoare annotation was computed. [2018-11-28 23:10:47,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:10:47 BoogieIcfgContainer [2018-11-28 23:10:47,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:10:47,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:10:47,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:10:47,008 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:10:47,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:21" (3/4) ... [2018-11-28 23:10:47,012 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:10:47,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-11-28 23:10:47,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:10:47,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:10:47,026 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 23:10:47,026 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 23:10:47,027 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:10:47,075 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:10:47,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:10:47,077 INFO L168 Benchmark]: Toolchain (without parser) took 26771.91 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 790.1 MB). Free memory was 950.0 MB in the beginning and 1.3 GB in the end (delta: -319.5 MB). Peak memory consumption was 470.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:47,079 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:10:47,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.07 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:47,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.42 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:10:47,081 INFO L168 Benchmark]: Boogie Preprocessor took 23.93 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:10:47,083 INFO L168 Benchmark]: RCFGBuilder took 467.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:47,083 INFO L168 Benchmark]: TraceAbstraction took 25877.64 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 662.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -183.0 MB). Peak memory consumption was 479.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:47,085 INFO L168 Benchmark]: Witness Printer took 68.04 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:47,091 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.07 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.42 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.93 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 467.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25877.64 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 662.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -183.0 MB). Peak memory consumption was 479.2 MB. Max. memory is 11.5 GB. * Witness Printer took 68.04 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. SAFE Result, 25.7s OverallTime, 19 OverallIterations, 109 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 536 SDtfs, 1614 SDslu, 3086 SDs, 0 SdLazy, 2565 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4101 GetRequests, 3777 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 203 PreInvPairs, 285 NumberOfFragments, 191 HoareAnnotationTreeSize, 203 FomulaSimplifications, 1696 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2053 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 6958 NumberOfCodeBlocks, 6840 NumberOfCodeBlocksAsserted, 203 NumberOfCheckSat, 6925 ConstructedInterpolants, 0 QuantifiedInterpolants, 9672725 SizeOfPredicates, 37 NumberOfNonLiveVariables, 6075 ConjunctsInSsa, 621 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 112855/138708 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...