./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive/Fibonacci02.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.25-f470102 [2019-11-28 20:25:59,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:25:59,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:25:59,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:25:59,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:25:59,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:25:59,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:25:59,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:25:59,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:25:59,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:25:59,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:25:59,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:25:59,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:25:59,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:25:59,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:25:59,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:25:59,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:25:59,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:25:59,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:25:59,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:25:59,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:25:59,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:25:59,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:25:59,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:25:59,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:25:59,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:25:59,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:25:59,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:25:59,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:25:59,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:25:59,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:25:59,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:25:59,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:25:59,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:25:59,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:25:59,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:25:59,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:25:59,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:25:59,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:25:59,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:25:59,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:25:59,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:25:59,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:25:59,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:25:59,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:25:59,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:25:59,395 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:25:59,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:25:59,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:25:59,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:25:59,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:25:59,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:25:59,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:25:59,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:25:59,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:25:59,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:25:59,400 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:25:59,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:25:59,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:25:59,401 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:25:59,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:25:59,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:25:59,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:25:59,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:25:59,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:25:59,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:25:59,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:25:59,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:25:59,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:25:59,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:25:59,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:25:59,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:25:59,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:25:59,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2019-11-28 20:25:59,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:25:59,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:25:59,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:25:59,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:25:59,751 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:25:59,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 20:25:59,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cdc7d29/9c959ba82b7c4849a3c916dc791fd200/FLAG9693b24f4 [2019-11-28 20:26:00,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:26:00,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 20:26:00,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cdc7d29/9c959ba82b7c4849a3c916dc791fd200/FLAG9693b24f4 [2019-11-28 20:26:00,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cdc7d29/9c959ba82b7c4849a3c916dc791fd200 [2019-11-28 20:26:00,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:26:00,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:26:00,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:26:00,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:26:00,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:26:00,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:00,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388be10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00, skipping insertion in model container [2019-11-28 20:26:00,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:00,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:26:00,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:26:00,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:26:00,882 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:26:00,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:26:00,908 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:26:00,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00 WrapperNode [2019-11-28 20:26:00,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:26:00,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:26:00,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:26:00,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:26:00,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:00,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:00,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:26:01,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:26:01,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:26:01,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:26:01,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (1/1) ... [2019-11-28 20:26:01,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:26:01,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:26:01,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:26:01,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:26:01,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (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 [2019-11-28 20:26:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 20:26:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 20:26:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:26:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:26:01,289 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:26:01,290 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 20:26:01,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:01 BoogieIcfgContainer [2019-11-28 20:26:01,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:26:01,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:26:01,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:26:01,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:26:01,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:26:00" (1/3) ... [2019-11-28 20:26:01,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650b0ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:26:01, skipping insertion in model container [2019-11-28 20:26:01,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:00" (2/3) ... [2019-11-28 20:26:01,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650b0ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:26:01, skipping insertion in model container [2019-11-28 20:26:01,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:01" (3/3) ... [2019-11-28 20:26:01,324 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2019-11-28 20:26:01,341 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:26:01,348 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 20:26:01,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 20:26:01,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:26:01,420 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:26:01,420 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:26:01,421 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:26:01,421 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:26:01,421 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:26:01,421 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:26:01,421 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:26:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-28 20:26:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:26:01,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:01,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:26:01,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:01,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1701129783, now seen corresponding path program 1 times [2019-11-28 20:26:01,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:01,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922091825] [2019-11-28 20:26:01,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:01,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922091825] [2019-11-28 20:26:01,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:01,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:26:01,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708468795] [2019-11-28 20:26:01,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:01,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:26:01,684 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-11-28 20:26:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:01,848 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-11-28 20:26:01,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:26:01,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-28 20:26:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:01,863 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:26:01,863 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 20:26:01,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 20:26:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 20:26:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:26:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-28 20:26:01,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2019-11-28 20:26:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:01,930 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-28 20:26:01,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-28 20:26:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:26:01,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:01,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:01,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1195415763, now seen corresponding path program 1 times [2019-11-28 20:26:01,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:01,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229196142] [2019-11-28 20:26:01,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:01,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229196142] [2019-11-28 20:26:01,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:01,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:26:01,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062866930] [2019-11-28 20:26:01,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:01,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:01,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:01,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:01,966 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-11-28 20:26:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:01,992 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-28 20:26:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:01,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 20:26:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:01,995 INFO L225 Difference]: With dead ends: 23 [2019-11-28 20:26:01,995 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 20:26:01,997 INFO L630 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 [2019-11-28 20:26:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 20:26:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 20:26:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:26:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 20:26:02,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2019-11-28 20:26:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:02,006 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 20:26:02,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-28 20:26:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:26:02,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:02,008 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:02,008 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1513310471, now seen corresponding path program 1 times [2019-11-28 20:26:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:02,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466535491] [2019-11-28 20:26:02,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:02,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466535491] [2019-11-28 20:26:02,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34230954] [2019-11-28 20:26:02,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:02,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:26:02,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:02,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:02,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-28 20:26:02,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206675043] [2019-11-28 20:26:02,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:26:02,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:02,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:26:02,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:26:02,426 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 13 states. [2019-11-28 20:26:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:02,818 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-11-28 20:26:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:26:02,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-28 20:26:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:02,821 INFO L225 Difference]: With dead ends: 72 [2019-11-28 20:26:02,821 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:26:02,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:26:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:26:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-11-28 20:26:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:26:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-28 20:26:02,839 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 28 [2019-11-28 20:26:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:02,839 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-28 20:26:02,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:26:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-28 20:26:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:26:02,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:02,842 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:03,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:03,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash 317957503, now seen corresponding path program 1 times [2019-11-28 20:26:03,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:03,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369544089] [2019-11-28 20:26:03,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:26:03,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369544089] [2019-11-28 20:26:03,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110346183] [2019-11-28 20:26:03,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:26:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:03,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:03,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:03,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:03,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2019-11-28 20:26:03,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178470562] [2019-11-28 20:26:03,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:26:03,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:26:03,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:26:03,329 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 14 states. [2019-11-28 20:26:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:03,757 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-11-28 20:26:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:26:03,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-11-28 20:26:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:03,759 INFO L225 Difference]: With dead ends: 90 [2019-11-28 20:26:03,759 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:26:03,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:26:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:26:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-28 20:26:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:26:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-28 20:26:03,774 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 30 [2019-11-28 20:26:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:03,774 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-28 20:26:03,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:26:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-28 20:26:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:26:03,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:03,776 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:03,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:03,990 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -345552101, now seen corresponding path program 2 times [2019-11-28 20:26:03,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:03,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780842619] [2019-11-28 20:26:03,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780842619] [2019-11-28 20:26:04,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092401045] [2019-11-28 20:26:04,233 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:04,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:26:04,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:04,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:26:04,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 20:26:04,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:04,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2019-11-28 20:26:04,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870775446] [2019-11-28 20:26:04,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:04,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:26:04,342 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2019-11-28 20:26:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:04,376 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-11-28 20:26:04,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:26:04,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 20:26:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:04,378 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:26:04,378 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:26:04,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:26:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:26:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-28 20:26:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:26:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-28 20:26:04,390 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 34 [2019-11-28 20:26:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:04,391 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-28 20:26:04,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-11-28 20:26:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 20:26:04,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:04,393 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:04,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:04,602 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1803486695, now seen corresponding path program 1 times [2019-11-28 20:26:04,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:04,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236902568] [2019-11-28 20:26:04,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:04,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236902568] [2019-11-28 20:26:04,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719118650] [2019-11-28 20:26:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:04,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:26:04,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:04,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:04,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-28 20:26:04,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716637594] [2019-11-28 20:26:04,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:26:04,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:26:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:26:04,895 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 17 states. [2019-11-28 20:26:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:05,552 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-11-28 20:26:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:26:05,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-28 20:26:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:05,554 INFO L225 Difference]: With dead ends: 130 [2019-11-28 20:26:05,554 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 20:26:05,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-11-28 20:26:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 20:26:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2019-11-28 20:26:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 20:26:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2019-11-28 20:26:05,571 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 41 [2019-11-28 20:26:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:05,572 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2019-11-28 20:26:05,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:26:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2019-11-28 20:26:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 20:26:05,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:05,574 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:05,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:05,778 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:05,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1458107581, now seen corresponding path program 2 times [2019-11-28 20:26:05,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:05,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209096995] [2019-11-28 20:26:05,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:26:05,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209096995] [2019-11-28 20:26:05,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683990025] [2019-11-28 20:26:05,980 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:06,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:26:06,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:06,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:26:06,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:06,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:06,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 18 [2019-11-28 20:26:06,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124154230] [2019-11-28 20:26:06,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:26:06,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:26:06,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:26:06,055 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 18 states. [2019-11-28 20:26:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:06,651 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2019-11-28 20:26:06,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:26:06,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2019-11-28 20:26:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:06,654 INFO L225 Difference]: With dead ends: 158 [2019-11-28 20:26:06,654 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 20:26:06,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:26:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 20:26:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-11-28 20:26:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 20:26:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-11-28 20:26:06,669 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 42 [2019-11-28 20:26:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:06,670 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-11-28 20:26:06,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:26:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2019-11-28 20:26:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 20:26:06,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:06,672 INFO L410 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:06,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:06,876 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash -248795849, now seen corresponding path program 2 times [2019-11-28 20:26:06,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:06,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709942080] [2019-11-28 20:26:06,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:07,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709942080] [2019-11-28 20:26:07,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509307890] [2019-11-28 20:26:07,047 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:07,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:26:07,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:07,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:26:07,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-28 20:26:07,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:07,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2019-11-28 20:26:07,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856125443] [2019-11-28 20:26:07,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:07,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:26:07,119 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2019-11-28 20:26:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:07,155 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-11-28 20:26:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:26:07,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-28 20:26:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:07,159 INFO L225 Difference]: With dead ends: 89 [2019-11-28 20:26:07,159 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 20:26:07,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:26:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 20:26:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-28 20:26:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 20:26:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2019-11-28 20:26:07,170 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 47 [2019-11-28 20:26:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:07,171 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2019-11-28 20:26:07,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2019-11-28 20:26:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 20:26:07,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:07,172 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:07,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:07,376 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:07,376 INFO L82 PathProgramCache]: Analyzing trace with hash -714183989, now seen corresponding path program 1 times [2019-11-28 20:26:07,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:07,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205616537] [2019-11-28 20:26:07,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:07,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205616537] [2019-11-28 20:26:07,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678507109] [2019-11-28 20:26:07,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:26:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:07,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:26:07,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 22 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:07,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:07,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-28 20:26:07,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721638343] [2019-11-28 20:26:07,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:26:07,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:07,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:26:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:26:07,661 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 21 states. [2019-11-28 20:26:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:08,515 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2019-11-28 20:26:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 20:26:08,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-11-28 20:26:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:08,517 INFO L225 Difference]: With dead ends: 206 [2019-11-28 20:26:08,517 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 20:26:08,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 20:26:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 20:26:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2019-11-28 20:26:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:26:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2019-11-28 20:26:08,540 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 53 [2019-11-28 20:26:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:08,540 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2019-11-28 20:26:08,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:26:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2019-11-28 20:26:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 20:26:08,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:08,543 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:08,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:08,747 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1889266439, now seen corresponding path program 3 times [2019-11-28 20:26:08,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:08,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394397949] [2019-11-28 20:26:08,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 1 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:26:09,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394397949] [2019-11-28 20:26:09,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764794149] [2019-11-28 20:26:09,039 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:09,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 20:26:09,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:09,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:26:09,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-28 20:26:09,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:09,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2019-11-28 20:26:09,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448477374] [2019-11-28 20:26:09,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:09,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:26:09,160 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand 5 states. [2019-11-28 20:26:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:09,198 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2019-11-28 20:26:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:26:09,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-28 20:26:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:09,202 INFO L225 Difference]: With dead ends: 147 [2019-11-28 20:26:09,202 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 20:26:09,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:26:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 20:26:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2019-11-28 20:26:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:26:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2019-11-28 20:26:09,232 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 54 [2019-11-28 20:26:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:09,232 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2019-11-28 20:26:09,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2019-11-28 20:26:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 20:26:09,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:09,235 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:09,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:09,438 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:09,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:09,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1250306354, now seen corresponding path program 1 times [2019-11-28 20:26:09,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:09,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108205492] [2019-11-28 20:26:09,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 12 proven. 186 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:26:09,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108205492] [2019-11-28 20:26:09,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455848136] [2019-11-28 20:26:09,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:09,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:26:09,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 80 proven. 108 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 20:26:09,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:09,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 24 [2019-11-28 20:26:09,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805006721] [2019-11-28 20:26:09,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 20:26:09,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 20:26:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:26:09,830 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 24 states. [2019-11-28 20:26:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:10,764 INFO L93 Difference]: Finished difference Result 263 states and 338 transitions. [2019-11-28 20:26:10,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 20:26:10,764 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-11-28 20:26:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:10,766 INFO L225 Difference]: With dead ends: 263 [2019-11-28 20:26:10,766 INFO L226 Difference]: Without dead ends: 145 [2019-11-28 20:26:10,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 20:26:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-28 20:26:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2019-11-28 20:26:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 20:26:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2019-11-28 20:26:10,778 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 73 [2019-11-28 20:26:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:10,779 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2019-11-28 20:26:10,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 20:26:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2019-11-28 20:26:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 20:26:10,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:10,780 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:10,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:10,984 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:10,984 INFO L82 PathProgramCache]: Analyzing trace with hash -453713612, now seen corresponding path program 2 times [2019-11-28 20:26:10,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:10,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707950484] [2019-11-28 20:26:10,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 174 proven. 127 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:26:11,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707950484] [2019-11-28 20:26:11,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722738738] [2019-11-28 20:26:11,460 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:11,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:26:11,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:11,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 20:26:11,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:26:11,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:11,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 31 [2019-11-28 20:26:11,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509235191] [2019-11-28 20:26:11,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 20:26:11,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 20:26:11,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-11-28 20:26:11,588 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 31 states. [2019-11-28 20:26:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:13,396 INFO L93 Difference]: Finished difference Result 275 states and 347 transitions. [2019-11-28 20:26:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-28 20:26:13,397 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 85 [2019-11-28 20:26:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:13,398 INFO L225 Difference]: With dead ends: 275 [2019-11-28 20:26:13,401 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 20:26:13,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1353, Invalid=4197, Unknown=0, NotChecked=0, Total=5550 [2019-11-28 20:26:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 20:26:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-11-28 20:26:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 20:26:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2019-11-28 20:26:13,419 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 85 [2019-11-28 20:26:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:13,420 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2019-11-28 20:26:13,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 20:26:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2019-11-28 20:26:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 20:26:13,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:13,422 INFO L410 BasicCegarLoop]: trace histogram [12, 10, 8, 8, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 20:26:13,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:13,627 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:13,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1738955289, now seen corresponding path program 3 times [2019-11-28 20:26:13,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:13,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251123045] [2019-11-28 20:26:13,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 16 proven. 272 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:26:14,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251123045] [2019-11-28 20:26:14,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845615341] [2019-11-28 20:26:14,035 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:14,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 20:26:14,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:14,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:26:14,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 100 proven. 51 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-28 20:26:14,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:14,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 33 [2019-11-28 20:26:14,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666901375] [2019-11-28 20:26:14,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 20:26:14,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 20:26:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 20:26:14,261 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 33 states. [2019-11-28 20:26:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:15,671 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2019-11-28 20:26:15,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 20:26:15,671 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 92 [2019-11-28 20:26:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:15,673 INFO L225 Difference]: With dead ends: 265 [2019-11-28 20:26:15,673 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 20:26:15,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=517, Invalid=2453, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 20:26:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 20:26:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-28 20:26:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:26:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2019-11-28 20:26:15,684 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 92 [2019-11-28 20:26:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:15,685 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2019-11-28 20:26:15,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 20:26:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2019-11-28 20:26:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 20:26:15,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:15,687 INFO L410 BasicCegarLoop]: trace histogram [14, 11, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2019-11-28 20:26:15,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:15,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash -934108332, now seen corresponding path program 4 times [2019-11-28 20:26:15,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:15,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119019762] [2019-11-28 20:26:15,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 41 proven. 340 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-28 20:26:16,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119019762] [2019-11-28 20:26:16,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257967461] [2019-11-28 20:26:16,310 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:16,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:26:16,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:16,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 20:26:16,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 186 proven. 214 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 20:26:16,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:16,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 28 [2019-11-28 20:26:16,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766969045] [2019-11-28 20:26:16,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 20:26:16,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 20:26:16,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2019-11-28 20:26:16,429 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 28 states. [2019-11-28 20:26:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:17,455 INFO L93 Difference]: Finished difference Result 260 states and 297 transitions. [2019-11-28 20:26:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 20:26:17,456 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-11-28 20:26:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:17,458 INFO L225 Difference]: With dead ends: 260 [2019-11-28 20:26:17,458 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 20:26:17,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2019-11-28 20:26:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 20:26:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-28 20:26:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:26:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2019-11-28 20:26:17,469 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 111 [2019-11-28 20:26:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:17,470 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2019-11-28 20:26:17,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 20:26:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2019-11-28 20:26:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 20:26:17,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:17,472 INFO L410 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2019-11-28 20:26:17,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:17,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1590749972, now seen corresponding path program 5 times [2019-11-28 20:26:17,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:17,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457299300] [2019-11-28 20:26:17,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-28 20:26:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457299300] [2019-11-28 20:26:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989566924] [2019-11-28 20:26:17,825 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:17,880 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-28 20:26:17,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:17,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:26:17,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-28 20:26:17,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:17,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-28 20:26:17,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400181999] [2019-11-28 20:26:17,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:26:17,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:17,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:26:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:26:17,989 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand 13 states. [2019-11-28 20:26:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:18,075 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-28 20:26:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:26:18,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-11-28 20:26:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:18,078 INFO L225 Difference]: With dead ends: 134 [2019-11-28 20:26:18,078 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 20:26:18,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:26:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 20:26:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-11-28 20:26:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:26:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2019-11-28 20:26:18,092 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 112 [2019-11-28 20:26:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:18,093 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2019-11-28 20:26:18,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:26:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2019-11-28 20:26:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-28 20:26:18,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:18,095 INFO L410 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1] [2019-11-28 20:26:18,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:18,300 INFO L410 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2068608930, now seen corresponding path program 1 times [2019-11-28 20:26:18,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:18,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456347000] [2019-11-28 20:26:18,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-28 20:26:18,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456347000] [2019-11-28 20:26:18,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951536487] [2019-11-28 20:26:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:26:18,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-11-28 20:26:18,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:18,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2019-11-28 20:26:18,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254836351] [2019-11-28 20:26:18,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 20:26:18,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:26:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:26:18,557 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 15 states. [2019-11-28 20:26:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:18,633 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2019-11-28 20:26:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:26:18,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2019-11-28 20:26:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:18,635 INFO L225 Difference]: With dead ends: 132 [2019-11-28 20:26:18,635 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 20:26:18,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:26:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 20:26:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 20:26:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 20:26:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-11-28 20:26:18,644 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 113 [2019-11-28 20:26:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:18,644 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-11-28 20:26:18,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 20:26:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-11-28 20:26:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 20:26:18,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:18,647 INFO L410 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1] [2019-11-28 20:26:18,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:18,851 INFO L410 AbstractCegarLoop]: === Iteration 17 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1288089853, now seen corresponding path program 6 times [2019-11-28 20:26:18,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:18,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722525636] [2019-11-28 20:26:18,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-11-28 20:26:19,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722525636] [2019-11-28 20:26:19,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266270653] [2019-11-28 20:26:19,115 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:19,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-11-28 20:26:19,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:19,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 20:26:19,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-11-28 20:26:19,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:19,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-11-28 20:26:19,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263269603] [2019-11-28 20:26:19,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:26:19,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:19,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:26:19,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:26:19,315 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 17 states. [2019-11-28 20:26:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:19,375 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-11-28 20:26:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:26:19,375 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 165 [2019-11-28 20:26:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:19,377 INFO L225 Difference]: With dead ends: 131 [2019-11-28 20:26:19,377 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 20:26:19,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:26:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 20:26:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 20:26:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 20:26:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2019-11-28 20:26:19,392 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 165 [2019-11-28 20:26:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:19,393 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2019-11-28 20:26:19,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:26:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2019-11-28 20:26:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-28 20:26:19,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:19,398 INFO L410 BasicCegarLoop]: trace histogram [28, 24, 23, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 11, 11, 8, 5, 1, 1, 1] [2019-11-28 20:26:19,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:19,602 INFO L410 AbstractCegarLoop]: === Iteration 18 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1461844116, now seen corresponding path program 7 times [2019-11-28 20:26:19,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:19,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74363665] [2019-11-28 20:26:19,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-11-28 20:26:20,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74363665] [2019-11-28 20:26:20,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156511489] [2019-11-28 20:26:20,068 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-28 20:26:20,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-11-28 20:26:20,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:20,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2019-11-28 20:26:20,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487151527] [2019-11-28 20:26:20,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:26:20,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:26:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:26:20,352 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 21 states. [2019-11-28 20:26:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:20,419 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-11-28 20:26:20,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:26:20,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 257 [2019-11-28 20:26:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:20,421 INFO L225 Difference]: With dead ends: 131 [2019-11-28 20:26:20,421 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 20:26:20,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:26:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 20:26:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 20:26:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 20:26:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-11-28 20:26:20,433 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 257 [2019-11-28 20:26:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:20,436 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-11-28 20:26:20,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:26:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-11-28 20:26:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-28 20:26:20,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:20,443 INFO L410 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1] [2019-11-28 20:26:20,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:20,646 INFO L410 AbstractCegarLoop]: === Iteration 19 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 648414394, now seen corresponding path program 8 times [2019-11-28 20:26:20,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:20,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180917154] [2019-11-28 20:26:20,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2019-11-28 20:26:21,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180917154] [2019-11-28 20:26:21,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135609483] [2019-11-28 20:26:21,571 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:21,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:26:21,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:21,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-28 20:26:21,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2019-11-28 20:26:22,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:22,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2019-11-28 20:26:22,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511919977] [2019-11-28 20:26:22,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 20:26:22,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 20:26:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:26:22,002 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 25 states. [2019-11-28 20:26:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:22,088 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2019-11-28 20:26:22,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:26:22,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 408 [2019-11-28 20:26:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:22,091 INFO L225 Difference]: With dead ends: 131 [2019-11-28 20:26:22,091 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 20:26:22,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:26:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 20:26:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 20:26:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 20:26:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2019-11-28 20:26:22,099 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 408 [2019-11-28 20:26:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:22,100 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2019-11-28 20:26:22,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 20:26:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2019-11-28 20:26:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-11-28 20:26:22,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:22,117 INFO L410 BasicCegarLoop]: trace histogram [68, 66, 55, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 32, 21, 13, 1, 1, 1] [2019-11-28 20:26:22,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:22,321 INFO L410 AbstractCegarLoop]: === Iteration 20 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1470667451, now seen corresponding path program 9 times [2019-11-28 20:26:22,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:22,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956410827] [2019-11-28 20:26:22,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2019-11-28 20:26:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956410827] [2019-11-28 20:26:24,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56366719] [2019-11-28 20:26:24,308 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:24,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-11-28 20:26:24,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:24,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 133 conjunts are in the unsatisfiable core [2019-11-28 20:26:24,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2019-11-28 20:26:25,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:25,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2019-11-28 20:26:25,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838910144] [2019-11-28 20:26:25,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 20:26:25,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 20:26:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:26:25,081 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 29 states. [2019-11-28 20:26:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:25,201 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-28 20:26:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 20:26:25,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 657 [2019-11-28 20:26:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:25,204 INFO L225 Difference]: With dead ends: 131 [2019-11-28 20:26:25,204 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 20:26:25,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:26:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 20:26:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 20:26:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 20:26:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-28 20:26:25,211 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 657 [2019-11-28 20:26:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:25,213 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-28 20:26:25,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 20:26:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-28 20:26:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-11-28 20:26:25,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:25,223 INFO L410 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1] [2019-11-28 20:26:25,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:25,428 INFO L410 AbstractCegarLoop]: === Iteration 21 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash 607316682, now seen corresponding path program 10 times [2019-11-28 20:26:25,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:25,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746165283] [2019-11-28 20:26:25,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2019-11-28 20:26:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746165283] [2019-11-28 20:26:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613860509] [2019-11-28 20:26:29,607 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:29,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:26:29,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:29,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 217 conjunts are in the unsatisfiable core [2019-11-28 20:26:29,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2019-11-28 20:26:31,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:31,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 32 [2019-11-28 20:26:31,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125307821] [2019-11-28 20:26:31,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 20:26:31,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:31,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 20:26:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 20:26:31,504 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 33 states. [2019-11-28 20:26:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:31,601 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-11-28 20:26:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 20:26:31,602 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1063 [2019-11-28 20:26:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:31,605 INFO L225 Difference]: With dead ends: 130 [2019-11-28 20:26:31,605 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:26:31,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1495 GetRequests, 1464 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 20:26:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:26:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:26:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:26:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:26:31,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1063 [2019-11-28 20:26:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:31,608 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:26:31,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 20:26:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:26:31,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:26:31,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:31,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:26:32,394 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-11-28 20:26:32,589 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 11 [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-11-28 20:26:32,595 INFO L246 CegarLoopResult]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,596 INFO L246 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-28 20:26:32,596 INFO L246 CegarLoopResult]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,596 INFO L246 CegarLoopResult]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,596 INFO L249 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-11-28 20:26:32,597 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,597 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,597 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= fibonacci_~n |fibonacci_#in~n|) (not (<= |fibonacci_#in~n| 9))) (not (<= |fibonacci_#in~n| 1))) [2019-11-28 20:26:32,597 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,597 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,597 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,597 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= 2 |fibonacci_#t~ret0|))) (and (or (not (<= |fibonacci_#in~n| 4)) (not (<= 4 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 2) .cse0 .cse1)) (or (< 1 fibonacci_~n) (not (<= |fibonacci_#in~n| 2))) (or (not (<= 9 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 9)) (and (<= |fibonacci_#t~ret0| 21) .cse0 .cse1)) (or (not (<= |fibonacci_#in~n| 7)) (not (<= 7 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 8) .cse0 .cse1)) (or (not (<= |fibonacci_#in~n| 5)) (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) .cse1 (<= 5 fibonacci_~n)) (not (<= 5 |fibonacci_#in~n|))) (or (and (<= |fibonacci_#t~ret0| 1) (<= 1 |fibonacci_#t~ret0|) .cse0) (not (<= |fibonacci_#in~n| 3))) (or (and .cse0 .cse1 (<= |fibonacci_#t~ret0| 13)) (not (<= 8 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 8))) (or (and (<= |fibonacci_#t~ret0| 5) .cse0 .cse1) (not (<= 6 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 6))))) [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L246 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-11-28 20:26:32,598 INFO L242 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2019-11-28 20:26:32,599 INFO L246 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-11-28 20:26:32,599 INFO L242 CegarLoopResult]: At program point L25(lines 25 33) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 9) [2019-11-28 20:26:32,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:26:32 BoogieIcfgContainer [2019-11-28 20:26:32,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:26:32,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:26:32,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:26:32,615 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:26:32,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:01" (3/4) ... [2019-11-28 20:26:32,619 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:26:32,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-11-28 20:26:32,631 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:26:32,631 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:26:32,676 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:26:32,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:26:32,678 INFO L168 Benchmark]: Toolchain (without parser) took 32016.21 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 957.7 MB in the beginning and 1.7 GB in the end (delta: -724.4 MB). Peak memory consumption was 345.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:26:32,678 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:26:32,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.65 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:26:32,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:26:32,682 INFO L168 Benchmark]: Boogie Preprocessor took 22.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:26:32,683 INFO L168 Benchmark]: RCFGBuilder took 269.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:26:32,683 INFO L168 Benchmark]: TraceAbstraction took 31319.53 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 995.1 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -632.0 MB). Peak memory consumption was 363.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:26:32,684 INFO L168 Benchmark]: Witness Printer took 61.93 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 20:26:32,690 INFO L335 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.65 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 90.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31319.53 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 995.1 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -632.0 MB). Peak memory consumption was 363.1 MB. Max. memory is 11.5 GB. * Witness Printer took 61.93 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: x <= 9 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 6 error locations. Result: SAFE, OverallTime: 30.3s, OverallIterations: 21, TraceHistogramMax: 109, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 599 SDtfs, 2654 SDslu, 3666 SDs, 0 SdLazy, 6109 SolverSat, 1001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5006 GetRequests, 4475 SyntacticMatches, 0 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 122 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 302 PreInvPairs, 355 NumberOfFragments, 165 HoareAnnotationTreeSize, 302 FomulaSimplifications, 263 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1203 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 6943 NumberOfCodeBlocks, 6842 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 6903 ConstructedInterpolants, 0 QuantifiedInterpolants, 9620914 SizeOfPredicates, 60 NumberOfNonLiveVariables, 6257 ConjunctsInSsa, 675 ConjunctsInUnsatCore, 40 InterpolantComputations, 5 PerfectInterpolantSequences, 111077/138086 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...