./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 678e0110 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.24-678e011 [2019-11-19 22:18:25,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:18:25,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:18:25,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:18:25,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:18:25,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:18:25,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:18:25,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:18:25,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:18:25,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:18:25,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:18:25,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:18:25,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:18:25,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:18:25,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:18:25,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:18:25,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:18:25,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:18:25,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:18:25,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:18:25,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:18:25,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:18:25,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:18:25,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:18:25,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:18:25,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:18:25,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:18:25,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:18:25,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:18:25,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:18:25,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:18:25,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:18:25,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:18:25,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:18:25,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:18:25,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:18:25,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:18:25,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:18:25,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:18:25,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:18:25,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:18:25,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-19 22:18:25,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:18:25,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:18:25,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:18:25,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:18:25,159 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:18:25,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:18:25,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:18:25,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:18:25,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:18:25,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:18:25,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:18:25,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:18:25,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:18:25,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:18:25,163 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 22:18:25,163 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:18:25,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:18:25,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:18:25,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:18:25,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:18:25,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:18:25,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:18:25,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:18:25,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:18:25,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:18:25,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:18:25,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:18:25,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:18:25,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:18:25,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:18:25,168 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-19 22:18:25,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:18:25,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:18:25,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:18:25,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:18:25,515 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:18:25,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-19 22:18:25,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437e0f872/4844cddff1dd4f8fa93c10f5b6792b0e/FLAGa54545475 [2019-11-19 22:18:26,083 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:18:26,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-19 22:18:26,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437e0f872/4844cddff1dd4f8fa93c10f5b6792b0e/FLAGa54545475 [2019-11-19 22:18:26,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437e0f872/4844cddff1dd4f8fa93c10f5b6792b0e [2019-11-19 22:18:26,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:18:26,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:18:26,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:18:26,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:18:26,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:18:26,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ccec9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26, skipping insertion in model container [2019-11-19 22:18:26,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:18:26,505 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:18:26,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:18:26,750 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:18:26,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:18:26,788 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:18:26,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26 WrapperNode [2019-11-19 22:18:26,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:18:26,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:18:26,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:18:26,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:18:26,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:18:26,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:18:26,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:18:26,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:18:26,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (1/1) ... [2019-11-19 22:18:26,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:18:26,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:18:26,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:18:26,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:18:26,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (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-19 22:18:26,993 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-19 22:18:26,994 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-19 22:18:26,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:18:26,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:18:27,232 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:18:27,232 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:18:27,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:27 BoogieIcfgContainer [2019-11-19 22:18:27,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:18:27,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:18:27,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:18:27,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:18:27,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:18:26" (1/3) ... [2019-11-19 22:18:27,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab3058d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:27, skipping insertion in model container [2019-11-19 22:18:27,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:26" (2/3) ... [2019-11-19 22:18:27,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab3058d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:27, skipping insertion in model container [2019-11-19 22:18:27,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:27" (3/3) ... [2019-11-19 22:18:27,262 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2019-11-19 22:18:27,273 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:18:27,302 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-19 22:18:27,323 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-19 22:18:27,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:18:27,349 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:18:27,349 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:18:27,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:18:27,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:18:27,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:18:27,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:18:27,350 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:18:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-19 22:18:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 22:18:27,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:27,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:18:27,378 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-19 22:18:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1701129783, now seen corresponding path program 1 times [2019-11-19 22:18:27,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:27,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557964626] [2019-11-19 22:18:27,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:27,567 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-19 22:18:27,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557964626] [2019-11-19 22:18:27,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:27,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:27,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113075707] [2019-11-19 22:18:27,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:27,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:18:27,587 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-11-19 22:18:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:27,727 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-11-19 22:18:27,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:18:27,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-19 22:18:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:27,738 INFO L225 Difference]: With dead ends: 32 [2019-11-19 22:18:27,739 INFO L226 Difference]: Without dead ends: 21 [2019-11-19 22:18:27,742 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-19 22:18:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-19 22:18:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-19 22:18:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 22:18:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-19 22:18:27,787 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2019-11-19 22:18:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:27,788 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-19 22:18:27,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-19 22:18:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-19 22:18:27,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:27,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:27,790 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-19 22:18:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1195415763, now seen corresponding path program 1 times [2019-11-19 22:18:27,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:27,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862179346] [2019-11-19 22:18:27,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:27,815 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-19 22:18:27,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862179346] [2019-11-19 22:18:27,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:27,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:27,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338798452] [2019-11-19 22:18:27,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:27,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:27,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:27,819 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-11-19 22:18:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:27,843 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-19 22:18:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:27,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-19 22:18:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:27,846 INFO L225 Difference]: With dead ends: 23 [2019-11-19 22:18:27,846 INFO L226 Difference]: Without dead ends: 21 [2019-11-19 22:18:27,848 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-19 22:18:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-19 22:18:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-19 22:18:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 22:18:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-19 22:18:27,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2019-11-19 22:18:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:27,857 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-19 22:18:27,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-19 22:18:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:18:27,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:27,859 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-19 22:18:27,860 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-19 22:18:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1513310471, now seen corresponding path program 1 times [2019-11-19 22:18:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:27,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744778146] [2019-11-19 22:18:27,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:28,152 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-19 22:18:28,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744778146] [2019-11-19 22:18:28,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765779360] [2019-11-19 22:18:28,156 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-19 22:18:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:28,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:18:28,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:28,304 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-19 22:18:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-19 22:18:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228294457] [2019-11-19 22:18:28,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:18:28,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:18:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:28,310 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 13 states. [2019-11-19 22:18:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:28,710 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-11-19 22:18:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:18:28,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-19 22:18:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:28,715 INFO L225 Difference]: With dead ends: 72 [2019-11-19 22:18:28,717 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 22:18:28,718 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-19 22:18:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 22:18:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-11-19 22:18:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-19 22:18:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-19 22:18:28,757 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 28 [2019-11-19 22:18:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:28,759 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-19 22:18:28,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:18:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-19 22:18:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:18:28,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:28,763 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-19 22:18:28,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:28,970 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-19 22:18:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash 317957503, now seen corresponding path program 1 times [2019-11-19 22:18:28,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:28,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760599279] [2019-11-19 22:18:28,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:29,202 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-19 22:18:29,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760599279] [2019-11-19 22:18:29,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748951736] [2019-11-19 22:18:29,203 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:29,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:18:29,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:29,294 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-19 22:18:29,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:29,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2019-11-19 22:18:29,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741839524] [2019-11-19 22:18:29,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:18:29,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:18:29,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:18:29,299 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 14 states. [2019-11-19 22:18:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:29,748 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-11-19 22:18:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:18:29,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-11-19 22:18:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:29,750 INFO L225 Difference]: With dead ends: 90 [2019-11-19 22:18:29,750 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 22:18:29,752 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-19 22:18:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 22:18:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-19 22:18:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-19 22:18:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-19 22:18:29,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 30 [2019-11-19 22:18:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:29,779 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-19 22:18:29,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:18:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-19 22:18:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 22:18:29,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:29,784 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-19 22:18:29,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:29,988 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-19 22:18:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -345552101, now seen corresponding path program 2 times [2019-11-19 22:18:29,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:29,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706830319] [2019-11-19 22:18:29,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,192 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-19 22:18:30,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706830319] [2019-11-19 22:18:30,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952789955] [2019-11-19 22:18:30,194 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-19 22:18:30,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:30,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:30,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:18:30,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:30,281 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-19 22:18:30,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:30,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2019-11-19 22:18:30,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367109815] [2019-11-19 22:18:30,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:30,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:18:30,284 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2019-11-19 22:18:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:30,322 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-11-19 22:18:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:18:30,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-19 22:18:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:30,325 INFO L225 Difference]: With dead ends: 57 [2019-11-19 22:18:30,325 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 22:18:30,327 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-19 22:18:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 22:18:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-19 22:18:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 22:18:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-19 22:18:30,336 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 34 [2019-11-19 22:18:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:30,337 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-19 22:18:30,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-11-19 22:18:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 22:18:30,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:30,338 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-19 22:18:30,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:30,543 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-19 22:18:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1803486695, now seen corresponding path program 1 times [2019-11-19 22:18:30,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:30,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383771356] [2019-11-19 22:18:30,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,721 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-19 22:18:30,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383771356] [2019-11-19 22:18:30,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560925687] [2019-11-19 22:18:30,722 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-19 22:18:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:30,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:18:30,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:30,799 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-19 22:18:30,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:30,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-19 22:18:30,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885335513] [2019-11-19 22:18:30,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 22:18:30,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 22:18:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:18:30,802 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 17 states. [2019-11-19 22:18:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:31,421 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-11-19 22:18:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 22:18:31,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-19 22:18:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:31,424 INFO L225 Difference]: With dead ends: 130 [2019-11-19 22:18:31,424 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 22:18:31,426 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-19 22:18:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 22:18:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2019-11-19 22:18:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-19 22:18:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2019-11-19 22:18:31,441 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 41 [2019-11-19 22:18:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:31,442 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2019-11-19 22:18:31,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 22:18:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2019-11-19 22:18:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:18:31,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:31,444 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-19 22:18:31,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:31,647 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-19 22:18:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1458107581, now seen corresponding path program 2 times [2019-11-19 22:18:31,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:31,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725368231] [2019-11-19 22:18:31,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:31,858 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-19 22:18:31,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725368231] [2019-11-19 22:18:31,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712968056] [2019-11-19 22:18:31,858 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-19 22:18:31,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:31,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:31,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:18:31,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:31,933 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-19 22:18:31,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:31,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 18 [2019-11-19 22:18:31,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787838504] [2019-11-19 22:18:31,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:18:31,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:18:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:18:31,935 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 18 states. [2019-11-19 22:18:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:32,510 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2019-11-19 22:18:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 22:18:32,511 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2019-11-19 22:18:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:32,513 INFO L225 Difference]: With dead ends: 158 [2019-11-19 22:18:32,513 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 22:18:32,515 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-19 22:18:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 22:18:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-11-19 22:18:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 22:18:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-11-19 22:18:32,528 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 42 [2019-11-19 22:18:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:32,528 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-11-19 22:18:32,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 22:18:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2019-11-19 22:18:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 22:18:32,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:32,530 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-19 22:18:32,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:32,735 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-19 22:18:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash -248795849, now seen corresponding path program 2 times [2019-11-19 22:18:32,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:32,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981040090] [2019-11-19 22:18:32,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:32,925 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-19 22:18:32,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981040090] [2019-11-19 22:18:32,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842313662] [2019-11-19 22:18:32,926 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-19 22:18:32,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:32,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:32,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:18:32,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:32,995 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-19 22:18:32,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:32,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2019-11-19 22:18:32,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405175847] [2019-11-19 22:18:32,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:32,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:32,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:18:32,997 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2019-11-19 22:18:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:33,030 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-11-19 22:18:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:18:33,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-19 22:18:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:33,033 INFO L225 Difference]: With dead ends: 89 [2019-11-19 22:18:33,033 INFO L226 Difference]: Without dead ends: 88 [2019-11-19 22:18:33,034 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-19 22:18:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-19 22:18:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-19 22:18:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-19 22:18:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2019-11-19 22:18:33,045 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 47 [2019-11-19 22:18:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:33,045 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2019-11-19 22:18:33,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2019-11-19 22:18:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 22:18:33,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:33,047 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-19 22:18:33,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:33,251 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-19 22:18:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -714183989, now seen corresponding path program 1 times [2019-11-19 22:18:33,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:33,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4618210] [2019-11-19 22:18:33,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:33,459 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-19 22:18:33,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4618210] [2019-11-19 22:18:33,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334928198] [2019-11-19 22:18:33,460 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:33,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:18:33,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:33,532 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-19 22:18:33,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:33,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-19 22:18:33,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539032573] [2019-11-19 22:18:33,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:18:33,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:18:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:18:33,534 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 21 states. [2019-11-19 22:18:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:34,411 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2019-11-19 22:18:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 22:18:34,411 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-11-19 22:18:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:34,413 INFO L225 Difference]: With dead ends: 206 [2019-11-19 22:18:34,413 INFO L226 Difference]: Without dead ends: 134 [2019-11-19 22:18:34,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 22:18:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-19 22:18:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2019-11-19 22:18:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-19 22:18:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2019-11-19 22:18:34,435 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 53 [2019-11-19 22:18:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:34,436 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2019-11-19 22:18:34,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:18:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2019-11-19 22:18:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 22:18:34,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:34,437 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-19 22:18:34,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:34,642 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-19 22:18:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1889266439, now seen corresponding path program 3 times [2019-11-19 22:18:34,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:34,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120064158] [2019-11-19 22:18:34,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:34,885 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-19 22:18:34,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120064158] [2019-11-19 22:18:34,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422820442] [2019-11-19 22:18:34,886 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-19 22:18:34,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 22:18:34,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:34,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:18:34,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:34,977 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-19 22:18:34,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:34,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2019-11-19 22:18:34,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283227380] [2019-11-19 22:18:34,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:34,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:34,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:34,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:18:34,979 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand 5 states. [2019-11-19 22:18:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:35,015 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2019-11-19 22:18:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:18:35,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-19 22:18:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:35,018 INFO L225 Difference]: With dead ends: 147 [2019-11-19 22:18:35,018 INFO L226 Difference]: Without dead ends: 146 [2019-11-19 22:18:35,019 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-19 22:18:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-19 22:18:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2019-11-19 22:18:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 22:18:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2019-11-19 22:18:35,035 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 54 [2019-11-19 22:18:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:35,036 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2019-11-19 22:18:35,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2019-11-19 22:18:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 22:18:35,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:35,038 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-19 22:18:35,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:35,252 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-19 22:18:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1250306354, now seen corresponding path program 1 times [2019-11-19 22:18:35,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:35,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604039730] [2019-11-19 22:18:35,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:35,566 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-19 22:18:35,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604039730] [2019-11-19 22:18:35,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502116593] [2019-11-19 22:18:35,568 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-19 22:18:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:35,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:18:35,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:35,651 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-19 22:18:35,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:35,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 24 [2019-11-19 22:18:35,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676174485] [2019-11-19 22:18:35,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 22:18:35,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 22:18:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:18:35,654 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 24 states. [2019-11-19 22:18:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:36,571 INFO L93 Difference]: Finished difference Result 263 states and 338 transitions. [2019-11-19 22:18:36,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-19 22:18:36,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-11-19 22:18:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:36,573 INFO L225 Difference]: With dead ends: 263 [2019-11-19 22:18:36,573 INFO L226 Difference]: Without dead ends: 145 [2019-11-19 22:18:36,575 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-19 22:18:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-19 22:18:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2019-11-19 22:18:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-19 22:18:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2019-11-19 22:18:36,597 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 73 [2019-11-19 22:18:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:36,597 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2019-11-19 22:18:36,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 22:18:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2019-11-19 22:18:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-19 22:18:36,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:36,608 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-19 22:18:36,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:36,812 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-19 22:18:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash -453713612, now seen corresponding path program 2 times [2019-11-19 22:18:36,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:36,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680747155] [2019-11-19 22:18:36,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:37,299 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-19 22:18:37,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680747155] [2019-11-19 22:18:37,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417030948] [2019-11-19 22:18:37,300 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-19 22:18:37,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:37,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:37,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 22:18:37,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:37,462 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-19 22:18:37,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:37,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 31 [2019-11-19 22:18:37,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673550064] [2019-11-19 22:18:37,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-19 22:18:37,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:37,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-19 22:18:37,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-11-19 22:18:37,465 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 31 states. [2019-11-19 22:18:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:39,243 INFO L93 Difference]: Finished difference Result 275 states and 347 transitions. [2019-11-19 22:18:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-19 22:18:39,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 85 [2019-11-19 22:18:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:39,246 INFO L225 Difference]: With dead ends: 275 [2019-11-19 22:18:39,246 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 22:18:39,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1353, Invalid=4197, Unknown=0, NotChecked=0, Total=5550 [2019-11-19 22:18:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 22:18:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-11-19 22:18:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-19 22:18:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2019-11-19 22:18:39,261 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 85 [2019-11-19 22:18:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:39,261 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2019-11-19 22:18:39,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-19 22:18:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2019-11-19 22:18:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-19 22:18:39,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:39,263 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-19 22:18:39,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:39,468 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-19 22:18:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1738955289, now seen corresponding path program 3 times [2019-11-19 22:18:39,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:39,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916997077] [2019-11-19 22:18:39,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:39,865 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-19 22:18:39,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916997077] [2019-11-19 22:18:39,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13215659] [2019-11-19 22:18:39,866 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-19 22:18:39,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-19 22:18:39,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:39,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:18:39,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:40,143 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-19 22:18:40,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:40,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 33 [2019-11-19 22:18:40,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874916178] [2019-11-19 22:18:40,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-19 22:18:40,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:40,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-19 22:18:40,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 22:18:40,147 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 33 states. [2019-11-19 22:18:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:41,535 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2019-11-19 22:18:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-19 22:18:41,535 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 92 [2019-11-19 22:18:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:41,537 INFO L225 Difference]: With dead ends: 265 [2019-11-19 22:18:41,537 INFO L226 Difference]: Without dead ends: 142 [2019-11-19 22:18:41,542 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-19 22:18:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-19 22:18:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-19 22:18:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 22:18:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2019-11-19 22:18:41,554 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 92 [2019-11-19 22:18:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:41,556 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2019-11-19 22:18:41,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-19 22:18:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2019-11-19 22:18:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 22:18:41,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:41,558 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-19 22:18:41,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:41,762 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-19 22:18:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash -934108332, now seen corresponding path program 4 times [2019-11-19 22:18:41,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:41,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75194698] [2019-11-19 22:18:41,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:42,114 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-19 22:18:42,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75194698] [2019-11-19 22:18:42,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553049780] [2019-11-19 22:18:42,115 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-19 22:18:42,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:18:42,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:42,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:18:42,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:42,244 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-19 22:18:42,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:42,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 28 [2019-11-19 22:18:42,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857413813] [2019-11-19 22:18:42,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 22:18:42,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:42,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 22:18:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2019-11-19 22:18:42,249 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 28 states. [2019-11-19 22:18:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:43,294 INFO L93 Difference]: Finished difference Result 260 states and 297 transitions. [2019-11-19 22:18:43,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-19 22:18:43,294 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-11-19 22:18:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:43,297 INFO L225 Difference]: With dead ends: 260 [2019-11-19 22:18:43,297 INFO L226 Difference]: Without dead ends: 142 [2019-11-19 22:18:43,299 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-19 22:18:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-19 22:18:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-19 22:18:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 22:18:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2019-11-19 22:18:43,310 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 111 [2019-11-19 22:18:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:43,310 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2019-11-19 22:18:43,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 22:18:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2019-11-19 22:18:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-19 22:18:43,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:43,312 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-19 22:18:43,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:43,517 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-19 22:18:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1590749972, now seen corresponding path program 5 times [2019-11-19 22:18:43,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:43,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621017335] [2019-11-19 22:18:43,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:43,728 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-19 22:18:43,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621017335] [2019-11-19 22:18:43,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376140614] [2019-11-19 22:18:43,729 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-19 22:18:43,809 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-19 22:18:43,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:43,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:18:43,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:43,920 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-19 22:18:43,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:43,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-19 22:18:43,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995751912] [2019-11-19 22:18:43,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:18:43,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:18:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:43,926 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand 13 states. [2019-11-19 22:18:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:44,030 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-19 22:18:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:18:44,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-11-19 22:18:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:44,034 INFO L225 Difference]: With dead ends: 134 [2019-11-19 22:18:44,034 INFO L226 Difference]: Without dead ends: 133 [2019-11-19 22:18:44,038 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-19 22:18:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-19 22:18:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-11-19 22:18:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 22:18:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2019-11-19 22:18:44,058 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 112 [2019-11-19 22:18:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:44,059 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2019-11-19 22:18:44,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:18:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2019-11-19 22:18:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-19 22:18:44,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:44,063 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-19 22:18:44,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:44,268 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-19 22:18:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2068608930, now seen corresponding path program 1 times [2019-11-19 22:18:44,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:44,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306510978] [2019-11-19 22:18:44,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,410 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-19 22:18:44,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306510978] [2019-11-19 22:18:44,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247296382] [2019-11-19 22:18:44,411 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-19 22:18:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:18:44,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:44,552 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-19 22:18:44,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:44,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2019-11-19 22:18:44,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006488346] [2019-11-19 22:18:44,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 22:18:44,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:44,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:18:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:18:44,557 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 15 states. [2019-11-19 22:18:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:44,646 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2019-11-19 22:18:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:18:44,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2019-11-19 22:18:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:44,650 INFO L225 Difference]: With dead ends: 132 [2019-11-19 22:18:44,650 INFO L226 Difference]: Without dead ends: 130 [2019-11-19 22:18:44,650 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-19 22:18:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-19 22:18:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-19 22:18:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 22:18:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-11-19 22:18:44,658 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 113 [2019-11-19 22:18:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:44,658 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-11-19 22:18:44,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 22:18:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-11-19 22:18:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-19 22:18:44,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:44,661 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-19 22:18:44,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:44,864 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-19 22:18:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:44,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1288089853, now seen corresponding path program 6 times [2019-11-19 22:18:44,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:44,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015124145] [2019-11-19 22:18:44,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,129 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-19 22:18:45,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015124145] [2019-11-19 22:18:45,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893168234] [2019-11-19 22:18:45,130 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-19 22:18:45,207 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-11-19 22:18:45,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:45,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-19 22:18:45,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:45,320 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-19 22:18:45,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:45,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-11-19 22:18:45,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713497398] [2019-11-19 22:18:45,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 22:18:45,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 22:18:45,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:18:45,323 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 17 states. [2019-11-19 22:18:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:45,390 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-11-19 22:18:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:18:45,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 165 [2019-11-19 22:18:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:45,391 INFO L225 Difference]: With dead ends: 131 [2019-11-19 22:18:45,391 INFO L226 Difference]: Without dead ends: 130 [2019-11-19 22:18:45,392 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-19 22:18:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-19 22:18:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-19 22:18:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 22:18:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2019-11-19 22:18:45,400 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 165 [2019-11-19 22:18:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:45,401 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2019-11-19 22:18:45,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 22:18:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2019-11-19 22:18:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-19 22:18:45,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:45,405 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-19 22:18:45,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:45,609 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-19 22:18:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1461844116, now seen corresponding path program 7 times [2019-11-19 22:18:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:45,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719629485] [2019-11-19 22:18:45,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,160 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-19 22:18:46,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719629485] [2019-11-19 22:18:46,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38940304] [2019-11-19 22:18:46,161 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-19 22:18:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-19 22:18:46,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:46,441 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-19 22:18:46,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:46,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2019-11-19 22:18:46,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910765327] [2019-11-19 22:18:46,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:18:46,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:18:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:18:46,444 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 21 states. [2019-11-19 22:18:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:46,514 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-11-19 22:18:46,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 22:18:46,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 257 [2019-11-19 22:18:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:46,518 INFO L225 Difference]: With dead ends: 131 [2019-11-19 22:18:46,519 INFO L226 Difference]: Without dead ends: 130 [2019-11-19 22:18:46,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:18:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-19 22:18:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-19 22:18:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 22:18:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-11-19 22:18:46,534 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 257 [2019-11-19 22:18:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:46,536 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-11-19 22:18:46,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:18:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-11-19 22:18:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-19 22:18:46,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:46,544 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-19 22:18:46,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:46,750 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-19 22:18:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash 648414394, now seen corresponding path program 8 times [2019-11-19 22:18:46,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:46,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668325956] [2019-11-19 22:18:46,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:47,865 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-19 22:18:47,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668325956] [2019-11-19 22:18:47,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800526950] [2019-11-19 22:18:47,865 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-19 22:18:47,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:47,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:47,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-19 22:18:47,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:48,327 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-19 22:18:48,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:48,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2019-11-19 22:18:48,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903792841] [2019-11-19 22:18:48,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 22:18:48,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 22:18:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:18:48,330 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 25 states. [2019-11-19 22:18:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:48,425 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2019-11-19 22:18:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 22:18:48,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 408 [2019-11-19 22:18:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:48,429 INFO L225 Difference]: With dead ends: 131 [2019-11-19 22:18:48,429 INFO L226 Difference]: Without dead ends: 130 [2019-11-19 22:18:48,430 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-19 22:18:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-19 22:18:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-19 22:18:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 22:18:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2019-11-19 22:18:48,437 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 408 [2019-11-19 22:18:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:48,438 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2019-11-19 22:18:48,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 22:18:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2019-11-19 22:18:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-11-19 22:18:48,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:48,454 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-19 22:18:48,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:48,659 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-19 22:18:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1470667451, now seen corresponding path program 9 times [2019-11-19 22:18:48,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:48,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084779129] [2019-11-19 22:18:48,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:50,732 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-19 22:18:50,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084779129] [2019-11-19 22:18:50,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121768311] [2019-11-19 22:18:50,733 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-19 22:18:51,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-11-19 22:18:51,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:51,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 133 conjunts are in the unsatisfiable core [2019-11-19 22:18:51,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:51,712 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-19 22:18:51,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:51,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2019-11-19 22:18:51,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428292529] [2019-11-19 22:18:51,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-19 22:18:51,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:51,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-19 22:18:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:18:51,716 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 29 states. [2019-11-19 22:18:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:51,840 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-19 22:18:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:18:51,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 657 [2019-11-19 22:18:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:51,843 INFO L225 Difference]: With dead ends: 131 [2019-11-19 22:18:51,843 INFO L226 Difference]: Without dead ends: 130 [2019-11-19 22:18:51,844 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-19 22:18:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-19 22:18:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-19 22:18:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 22:18:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-19 22:18:51,850 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 657 [2019-11-19 22:18:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:51,851 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-19 22:18:51,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-19 22:18:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-19 22:18:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-11-19 22:18:51,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:51,862 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-19 22:18:52,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:52,067 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-19 22:18:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash 607316682, now seen corresponding path program 10 times [2019-11-19 22:18:52,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:52,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966992682] [2019-11-19 22:18:52,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:56,330 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-19 22:18:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966992682] [2019-11-19 22:18:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947621587] [2019-11-19 22:18:56,331 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-19 22:18:56,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:18:56,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:56,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 217 conjunts are in the unsatisfiable core [2019-11-19 22:18:56,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:58,517 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-19 22:18:58,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:58,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 32 [2019-11-19 22:18:58,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390172472] [2019-11-19 22:18:58,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-19 22:18:58,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-19 22:18:58,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 22:18:58,520 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 33 states. [2019-11-19 22:18:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:58,620 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-11-19 22:18:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 22:18:58,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1063 [2019-11-19 22:18:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:58,623 INFO L225 Difference]: With dead ends: 130 [2019-11-19 22:18:58,623 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:18:58,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1495 GetRequests, 1464 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 22:18:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:18:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:18:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:18:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:18:58,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1063 [2019-11-19 22:18:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:58,626 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:18:58,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-19 22:18:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:18:58,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:18:58,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:58,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:18:59,545 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-11-19 22:18:59,717 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 11 [2019-11-19 22:18:59,722 INFO L444 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,723 INFO L444 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,724 INFO L447 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-11-19 22:18:59,724 INFO L444 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,724 INFO L444 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,724 INFO L440 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (not (<= |fibonacci_#in~n| 9)) (= fibonacci_~n |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 1))) [2019-11-19 22:18:59,724 INFO L444 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,724 INFO L444 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,725 INFO L444 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,725 INFO L440 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse1 (<= 2 |fibonacci_#t~ret0|)) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (and (or (and (<= |fibonacci_#t~ret0| 21) .cse0 .cse1) (not (<= 9 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 9))) (or (or (not (<= |fibonacci_#in~n| 4)) (not (<= 4 |fibonacci_#in~n|))) (and (<= |fibonacci_#t~ret0| 2) .cse0 .cse1)) (or (not (<= |fibonacci_#in~n| 2)) (< 1 fibonacci_~n)) (or (not (<= |fibonacci_#in~n| 7)) (not (<= 7 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 8) .cse0 .cse1)) (or (not (<= |fibonacci_#in~n| 6)) (and (<= |fibonacci_#t~ret0| 5) .cse0 .cse1) (not (<= 6 |fibonacci_#in~n|))) (or (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) .cse1 (<= 5 fibonacci_~n)) (not (<= |fibonacci_#in~n| 5)) (not (<= 5 |fibonacci_#in~n|))) (or (not (<= 8 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 8)) (and .cse0 .cse1 (<= |fibonacci_#t~ret0| 13))) (or (and (<= |fibonacci_#t~ret0| 1) (<= 1 |fibonacci_#t~ret0|) .cse0) (not (<= |fibonacci_#in~n| 3))))) [2019-11-19 22:18:59,725 INFO L444 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,726 INFO L444 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,726 INFO L444 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-19 22:18:59,726 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:18:59,726 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 22:18:59,726 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:18:59,726 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:18:59,727 INFO L444 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-11-19 22:18:59,727 INFO L440 ceAbstractionStarter]: 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-19 22:18:59,727 INFO L444 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-11-19 22:18:59,727 INFO L440 ceAbstractionStarter]: At program point L25(lines 25 33) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 9) [2019-11-19 22:18:59,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:59 BoogieIcfgContainer [2019-11-19 22:18:59,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:18:59,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:18:59,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:18:59,741 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:18:59,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:27" (3/4) ... [2019-11-19 22:18:59,746 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:18:59,752 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-11-19 22:18:59,757 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 22:18:59,757 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:18:59,801 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:18:59,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:18:59,803 INFO L168 Benchmark]: Toolchain (without parser) took 33333.67 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 960.4 MB in the beginning and 861.5 MB in the end (delta: 98.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-19 22:18:59,803 INFO L168 Benchmark]: CDTParser took 0.30 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-19 22:18:59,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.36 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:59,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:59,805 INFO L168 Benchmark]: Boogie Preprocessor took 26.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:59,806 INFO L168 Benchmark]: RCFGBuilder took 311.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:59,806 INFO L168 Benchmark]: TraceAbstraction took 32503.21 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 930.6 MB). Free memory was 1.1 GB in the beginning and 861.5 MB in the end (delta: 244.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-19 22:18:59,807 INFO L168 Benchmark]: Witness Printer took 60.64 ms. Allocated memory is still 2.1 GB. Free memory is still 861.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:18:59,810 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.30 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 318.36 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 106.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32503.21 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 930.6 MB). Free memory was 1.1 GB in the beginning and 861.5 MB in the end (delta: 244.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 60.64 ms. Allocated memory is still 2.1 GB. Free memory is still 861.5 MB. There was no memory consumed. 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: 32.3s, OverallIterations: 21, TraceHistogramMax: 109, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 599 SDtfs, 2654 SDslu, 3666 SDs, 0 SdLazy, 6109 SolverSat, 1001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5006 GetRequests, 4475 SyntacticMatches, 0 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 7.7s 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, 166 HoareAnnotationTreeSize, 302 FomulaSimplifications, 263 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1202 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.6s 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...