/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:50:23,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:50:23,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:50:23,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:50:23,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:50:23,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:50:23,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:50:23,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:50:23,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:50:23,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:50:23,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:50:23,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:50:23,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:50:23,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:50:23,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:50:23,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:50:23,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:50:23,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:50:23,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:50:23,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:50:23,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:50:23,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:50:23,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:50:23,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:50:23,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:50:23,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:50:23,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:50:23,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:50:23,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:50:23,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:50:23,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:50:23,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:50:23,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:50:23,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:50:23,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:50:23,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:50:23,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:50:23,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:50:23,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:50:23,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:50:23,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:50:23,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 04:50:23,490 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:50:23,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:50:23,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:50:23,495 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:50:23,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:50:23,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:50:23,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:50:23,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:50:23,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:50:23,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:50:23,497 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:50:23,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:50:23,498 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:50:23,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:50:23,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:50:23,499 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:50:23,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:50:23,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:50:23,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:50:23,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:50:23,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:50:23,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:50:23,500 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 04:50:23,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:50:23,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:50:23,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:50:23,927 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:50:23,927 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:50:23,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-11-07 04:50:24,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8743687b3/1d60a0c2a82c433a813c429d548afa59/FLAG4d467d2a8 [2020-11-07 04:50:24,686 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:50:24,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-11-07 04:50:24,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8743687b3/1d60a0c2a82c433a813c429d548afa59/FLAG4d467d2a8 [2020-11-07 04:50:25,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8743687b3/1d60a0c2a82c433a813c429d548afa59 [2020-11-07 04:50:25,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:50:25,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:50:25,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:50:25,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:50:25,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:50:25,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c8415f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25, skipping insertion in model container [2020-11-07 04:50:25,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:50:25,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:50:25,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:50:25,275 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:50:25,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:50:25,308 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:50:25,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25 WrapperNode [2020-11-07 04:50:25,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:50:25,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:50:25,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:50:25,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:50:25,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (1/1) ... [2020-11-07 04:50:25,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:50:25,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:50:25,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:50:25,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:50:25,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (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 [2020-11-07 04:50:25,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:50:25,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:50:25,419 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:50:25,419 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-07 04:50:25,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:50:25,420 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:50:25,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:50:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:50:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:50:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:50:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:50:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:50:25,709 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:50:25,709 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 04:50:25,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:25 BoogieIcfgContainer [2020-11-07 04:50:25,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:50:25,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:50:25,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:50:25,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:50:25,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:50:25" (1/3) ... [2020-11-07 04:50:25,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b509a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:25, skipping insertion in model container [2020-11-07 04:50:25,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:25" (2/3) ... [2020-11-07 04:50:25,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b509a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:25, skipping insertion in model container [2020-11-07 04:50:25,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:25" (3/3) ... [2020-11-07 04:50:25,722 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-11-07 04:50:25,742 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:50:25,745 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:50:25,778 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:50:25,835 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:50:25,836 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:50:25,836 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:50:25,839 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:50:25,839 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:50:25,840 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:50:25,840 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:50:25,840 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:50:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-11-07 04:50:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 04:50:25,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:25,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:25,882 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:25,889 INFO L82 PathProgramCache]: Analyzing trace with hash 274389233, now seen corresponding path program 1 times [2020-11-07 04:50:25,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:25,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24716616] [2020-11-07 04:50:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:26,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:26,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:50:26,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24716616] [2020-11-07 04:50:26,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:26,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 04:50:26,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618026929] [2020-11-07 04:50:26,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:26,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:26,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:26,509 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 8 states. [2020-11-07 04:50:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:27,028 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-11-07 04:50:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:50:27,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-07 04:50:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:27,040 INFO L225 Difference]: With dead ends: 63 [2020-11-07 04:50:27,040 INFO L226 Difference]: Without dead ends: 40 [2020-11-07 04:50:27,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:50:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-07 04:50:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-07 04:50:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-07 04:50:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-11-07 04:50:27,100 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 28 [2020-11-07 04:50:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:27,101 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-11-07 04:50:27,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-11-07 04:50:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-07 04:50:27,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:27,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:27,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:50:27,105 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash -393682023, now seen corresponding path program 1 times [2020-11-07 04:50:27,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:27,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408488223] [2020-11-07 04:50:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:27,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:27,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:50:27,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408488223] [2020-11-07 04:50:27,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:27,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 04:50:27,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088723573] [2020-11-07 04:50:27,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:27,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:27,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:27,312 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2020-11-07 04:50:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:27,723 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-11-07 04:50:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:50:27,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-11-07 04:50:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:27,726 INFO L225 Difference]: With dead ends: 49 [2020-11-07 04:50:27,726 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 04:50:27,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:50:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 04:50:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-11-07 04:50:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-07 04:50:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-11-07 04:50:27,742 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 29 [2020-11-07 04:50:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:27,743 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-11-07 04:50:27,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-11-07 04:50:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 04:50:27,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:27,745 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:27,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:50:27,746 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:27,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1206167652, now seen corresponding path program 1 times [2020-11-07 04:50:27,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:27,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [919422043] [2020-11-07 04:50:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:27,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:27,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:27,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 04:50:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 04:50:28,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [919422043] [2020-11-07 04:50:28,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:28,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:50:28,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895979814] [2020-11-07 04:50:28,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:28,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:28,032 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2020-11-07 04:50:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:28,363 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-11-07 04:50:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:50:28,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-07 04:50:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:28,366 INFO L225 Difference]: With dead ends: 65 [2020-11-07 04:50:28,366 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 04:50:28,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 04:50:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 04:50:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 04:50:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-11-07 04:50:28,381 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 45 [2020-11-07 04:50:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:28,381 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-11-07 04:50:28,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-11-07 04:50:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 04:50:28,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:28,383 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:28,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:50:28,384 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1636516106, now seen corresponding path program 1 times [2020-11-07 04:50:28,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:28,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390207721] [2020-11-07 04:50:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 04:50:28,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390207721] [2020-11-07 04:50:28,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:28,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:50:28,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834344729] [2020-11-07 04:50:28,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:50:28,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:50:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:50:28,632 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2020-11-07 04:50:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:29,683 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2020-11-07 04:50:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:50:29,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-11-07 04:50:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:29,692 INFO L225 Difference]: With dead ends: 61 [2020-11-07 04:50:29,692 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 04:50:29,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:50:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 04:50:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-11-07 04:50:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 04:50:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2020-11-07 04:50:29,713 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 46 [2020-11-07 04:50:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:29,713 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2020-11-07 04:50:29,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:50:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2020-11-07 04:50:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 04:50:29,716 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:29,716 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:29,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:50:29,717 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1018144491, now seen corresponding path program 1 times [2020-11-07 04:50:29,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:29,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897150690] [2020-11-07 04:50:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 04:50:29,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897150690] [2020-11-07 04:50:29,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:29,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:50:29,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669769905] [2020-11-07 04:50:29,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:29,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:29,907 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 7 states. [2020-11-07 04:50:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:30,464 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2020-11-07 04:50:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:50:30,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2020-11-07 04:50:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:30,470 INFO L225 Difference]: With dead ends: 86 [2020-11-07 04:50:30,470 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 04:50:30,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:50:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 04:50:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 04:50:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 04:50:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-11-07 04:50:30,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 65 [2020-11-07 04:50:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:30,490 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-11-07 04:50:30,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-11-07 04:50:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 04:50:30,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:30,493 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:30,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:50:30,493 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1280637961, now seen corresponding path program 2 times [2020-11-07 04:50:30,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:30,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440681964] [2020-11-07 04:50:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 04:50:30,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440681964] [2020-11-07 04:50:30,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:30,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:50:30,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110257845] [2020-11-07 04:50:30,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:30,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:30,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:30,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:30,686 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2020-11-07 04:50:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:31,237 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-11-07 04:50:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:50:31,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-07 04:50:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:31,240 INFO L225 Difference]: With dead ends: 87 [2020-11-07 04:50:31,241 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 04:50:31,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:50:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 04:50:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 04:50:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 04:50:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2020-11-07 04:50:31,268 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 63 [2020-11-07 04:50:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:31,269 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2020-11-07 04:50:31,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-11-07 04:50:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 04:50:31,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:31,272 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:31,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:50:31,272 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1382349825, now seen corresponding path program 3 times [2020-11-07 04:50:31,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:31,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091557015] [2020-11-07 04:50:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 04:50:31,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091557015] [2020-11-07 04:50:31,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:31,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 04:50:31,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653081631] [2020-11-07 04:50:31,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 04:50:31,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:31,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 04:50:31,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:50:31,565 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 14 states. [2020-11-07 04:50:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:32,764 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 04:50:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:50:32,765 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2020-11-07 04:50:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:32,767 INFO L225 Difference]: With dead ends: 71 [2020-11-07 04:50:32,769 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 04:50:32,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2020-11-07 04:50:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 04:50:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-11-07 04:50:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 04:50:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-11-07 04:50:32,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 64 [2020-11-07 04:50:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:32,798 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-11-07 04:50:32,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 04:50:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-11-07 04:50:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 04:50:32,800 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:32,801 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:32,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:50:32,801 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash -234313849, now seen corresponding path program 4 times [2020-11-07 04:50:32,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:32,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481386665] [2020-11-07 04:50:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 57 proven. 70 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 04:50:33,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [481386665] [2020-11-07 04:50:33,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:33,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:50:33,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551675177] [2020-11-07 04:50:33,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:50:33,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:33,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:50:33,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:33,096 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 9 states. [2020-11-07 04:50:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:33,870 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2020-11-07 04:50:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:33,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2020-11-07 04:50:33,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:33,874 INFO L225 Difference]: With dead ends: 108 [2020-11-07 04:50:33,874 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 04:50:33,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:50:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 04:50:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-11-07 04:50:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 04:50:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2020-11-07 04:50:33,923 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 99 [2020-11-07 04:50:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:33,923 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2020-11-07 04:50:33,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:50:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2020-11-07 04:50:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 04:50:33,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:33,928 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:33,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:50:33,928 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash 85893735, now seen corresponding path program 5 times [2020-11-07 04:50:33,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:33,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1853318565] [2020-11-07 04:50:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-11-07 04:50:34,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1853318565] [2020-11-07 04:50:34,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:34,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:34,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571685459] [2020-11-07 04:50:34,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:34,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:34,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:34,323 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 11 states. [2020-11-07 04:50:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:35,410 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2020-11-07 04:50:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:50:35,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2020-11-07 04:50:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:35,414 INFO L225 Difference]: With dead ends: 136 [2020-11-07 04:50:35,415 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 04:50:35,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2020-11-07 04:50:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 04:50:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2020-11-07 04:50:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 04:50:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-11-07 04:50:35,441 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 135 [2020-11-07 04:50:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:35,442 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-11-07 04:50:35,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-11-07 04:50:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 04:50:35,443 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:35,444 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:35,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:50:35,444 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash -304626607, now seen corresponding path program 6 times [2020-11-07 04:50:35,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:35,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826212592] [2020-11-07 04:50:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 04:50:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 8 proven. 109 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-11-07 04:50:35,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826212592] [2020-11-07 04:50:35,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:35,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:50:35,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934872713] [2020-11-07 04:50:35,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:50:35,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:50:35,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:50:35,766 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 16 states. [2020-11-07 04:50:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:36,858 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-11-07 04:50:36,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:50:36,859 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-11-07 04:50:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:36,865 INFO L225 Difference]: With dead ends: 79 [2020-11-07 04:50:36,865 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 04:50:36,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2020-11-07 04:50:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 04:50:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 04:50:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 04:50:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 04:50:36,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2020-11-07 04:50:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:36,870 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 04:50:36,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:50:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 04:50:36,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 04:50:36,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 04:50:36,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 04:50:39,364 WARN L194 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-11-07 04:50:39,568 WARN L194 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-11-07 04:50:39,677 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 7 [2020-11-07 04:50:39,875 WARN L194 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-11-07 04:50:40,118 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 28 [2020-11-07 04:50:40,415 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 16 [2020-11-07 04:50:40,900 WARN L194 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 15 [2020-11-07 04:50:41,172 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 21 [2020-11-07 04:50:41,842 WARN L194 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-11-07 04:50:41,989 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 6 [2020-11-07 04:50:42,180 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,180 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,181 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,181 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,181 INFO L262 CegarLoopResult]: At program point fibonacciFINAL(lines 16 24) the Hoare annotation is: (let ((.cse1 (<= |fibonacci_#in~n| 0))) (let ((.cse2 (or (and .cse1 (<= |fibonacci_#res| 0)) (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#res| 1)))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 .cse1 (<= 0 |fibonacci_#res|) .cse2) (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) .cse0 .cse2) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|))))) [2020-11-07 04:50:42,181 INFO L269 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-11-07 04:50:42,182 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 2 |fibonacci_#in~n|)) [2020-11-07 04:50:42,182 INFO L262 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|) (<= 2 |fibonacci_#in~n|)))) [2020-11-07 04:50:42,182 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) (= fibonacci_~n |fibonacci_#in~n|)) [2020-11-07 04:50:42,182 INFO L262 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|) (<= 2 |fibonacci_#in~n|)))) [2020-11-07 04:50:42,182 INFO L262 CegarLoopResult]: At program point L19(lines 19 23) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-11-07 04:50:42,182 INFO L262 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)) (<= 1 |fibonacci_#t~ret7|) (< 1 fibonacci_~n) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) [2020-11-07 04:50:42,183 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| 0)) [2020-11-07 04:50:42,183 INFO L262 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)) (<= 1 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) [2020-11-07 04:50:42,183 INFO L262 CegarLoopResult]: At program point fibonacciEXIT(lines 16 24) the Hoare annotation is: (let ((.cse1 (<= |fibonacci_#in~n| 0))) (let ((.cse2 (or (and .cse1 (<= |fibonacci_#res| 0)) (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#res| 1)))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 .cse1 (<= 0 |fibonacci_#res|) .cse2) (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) .cse0 .cse2) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|))))) [2020-11-07 04:50:42,183 INFO L262 CegarLoopResult]: At program point L17(lines 17 23) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-11-07 04:50:42,184 INFO L262 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)))) (or (and .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)) (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= fibonacci_~n 2) (<= 1 (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8|)) .cse0 .cse1 (<= 1 |fibonacci_#t~ret7|))))) [2020-11-07 04:50:42,184 INFO L262 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)))) (or (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|)) (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))))) (= fibonacci_~n |fibonacci_#in~n|) (< 1 fibonacci_~n)) [2020-11-07 04:50:42,184 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,184 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,184 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,184 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,184 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,184 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 04:50:42,185 INFO L262 CegarLoopResult]: At program point L33(lines 33 37) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-11-07 04:50:42,186 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 04:50:42,186 INFO L262 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret10| 1)) [2020-11-07 04:50:42,186 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 04:50:42,186 INFO L262 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret10| 1)) [2020-11-07 04:50:42,186 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 27 38) the Hoare annotation is: true [2020-11-07 04:50:42,186 INFO L269 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-11-07 04:50:42,186 INFO L262 CegarLoopResult]: At program point L32-3(line 32) the Hoare annotation is: (and (<= main_~x~0 (+ main_~result~0 1)) (<= main_~x~0 (+ |main_#t~ret10| 1))) [2020-11-07 04:50:42,187 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 04:50:42,187 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 04:50:42,187 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 27 38) the Hoare annotation is: true [2020-11-07 04:50:42,187 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 27 38) the Hoare annotation is: true [2020-11-07 04:50:42,187 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: false [2020-11-07 04:50:42,187 INFO L262 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: false [2020-11-07 04:50:42,187 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 04:50:42,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:50:42 BoogieIcfgContainer [2020-11-07 04:50:42,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 04:50:42,216 INFO L168 Benchmark]: Toolchain (without parser) took 17148.63 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 127.8 MB in the beginning and 192.3 MB in the end (delta: -64.5 MB). Peak memory consumption was 205.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:42,216 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 127.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 04:50:42,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.83 ms. Allocated memory is still 151.0 MB. Free memory was 127.2 MB in the beginning and 118.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:42,224 INFO L168 Benchmark]: Boogie Preprocessor took 32.46 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:42,225 INFO L168 Benchmark]: RCFGBuilder took 367.86 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 102.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:42,229 INFO L168 Benchmark]: TraceAbstraction took 16498.64 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 101.8 MB in the beginning and 192.3 MB in the end (delta: -90.5 MB). Peak memory consumption was 179.2 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:42,236 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 127.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 237.83 ms. Allocated memory is still 151.0 MB. Free memory was 127.2 MB in the beginning and 118.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.46 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 367.86 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 102.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16498.64 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 101.8 MB in the beginning and 192.3 MB in the end (delta: -90.5 MB). Peak memory consumption was 179.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: ((((n == \old(n) && \old(n) <= 0) && 0 <= \result) && ((\old(n) <= 0 && \result <= 0) || (1 <= \result && \result <= 1))) || (((1 <= \old(n) && \old(n) <= 1) && n == \old(n)) && ((\old(n) <= 0 && \result <= 0) || (1 <= \result && \result <= 1)))) || ((n == \old(n) && \old(n) <= \result + 1) && 2 <= \old(n)) - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.0s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 354 SDtfs, 646 SDslu, 845 SDs, 0 SdLazy, 1797 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=9, 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, 10 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 47 LocationsWithAnnotation, 419 PreInvPairs, 708 NumberOfFragments, 424 HoareAnnotationTreeSize, 419 FomulaSimplifications, 46016 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 47 FomulaSimplificationsInter, 10468 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 133071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 675/1096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...