/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:38:27,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:38:27,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:38:27,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:38:27,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:38:27,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:38:27,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:38:27,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:38:27,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:38:27,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:38:27,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:38:27,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:38:27,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:38:27,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:38:27,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:38:27,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:38:27,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:38:27,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:38:27,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:38:27,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:38:27,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:38:27,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:38:27,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:38:27,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:38:27,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:38:27,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:38:27,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:38:27,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:38:27,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:38:27,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:38:27,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:38:27,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:38:27,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:38:27,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:38:27,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:38:27,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:38:27,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:38:27,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:38:27,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:38:27,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:38:27,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:38:27,622 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 00:38:27,648 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:38:27,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:38:27,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:38:27,655 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:38:27,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:38:27,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:38:27,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:38:27,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:38:27,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:38:27,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:38:27,658 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:38:27,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:38:27,658 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:38:27,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:38:27,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:38:27,659 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:38:27,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:38:27,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:38:27,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:38:27,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:38:27,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:38:27,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:38:27,660 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 [2020-11-07 00:38:28,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:38:28,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:38:28,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:38:28,198 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:38:28,199 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:38:28,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-11-07 00:38:28,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59370a7a6/76cf06dc99b54068b933423d7554d200/FLAGc9ab7313b [2020-11-07 00:38:29,028 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:38:29,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-11-07 00:38:29,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59370a7a6/76cf06dc99b54068b933423d7554d200/FLAGc9ab7313b [2020-11-07 00:38:29,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59370a7a6/76cf06dc99b54068b933423d7554d200 [2020-11-07 00:38:29,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:38:29,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:38:29,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:38:29,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:38:29,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:38:29,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0ff485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29, skipping insertion in model container [2020-11-07 00:38:29,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:38:29,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:38:29,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:38:29,697 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:38:29,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:38:29,751 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:38:29,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29 WrapperNode [2020-11-07 00:38:29,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:38:29,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:38:29,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:38:29,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:38:29,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (1/1) ... [2020-11-07 00:38:29,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:38:29,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:38:29,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:38:29,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:38:29,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (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 00:38:29,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:38:29,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:38:29,949 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:38:29,949 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:38:29,949 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:38:29,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:38:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:38:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:38:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:38:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:38:29,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:38:29,952 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:38:29,952 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:38:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:38:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:38:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:38:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:38:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:38:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:38:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:38:30,571 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:38:30,572 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:38:30,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:38:30 BoogieIcfgContainer [2020-11-07 00:38:30,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:38:30,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:38:30,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:38:30,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:38:30,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:38:29" (1/3) ... [2020-11-07 00:38:30,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b2c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:38:30, skipping insertion in model container [2020-11-07 00:38:30,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:29" (2/3) ... [2020-11-07 00:38:30,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b2c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:38:30, skipping insertion in model container [2020-11-07 00:38:30,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:38:30" (3/3) ... [2020-11-07 00:38:30,606 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-11-07 00:38:30,623 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:38:30,627 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:38:30,641 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:38:30,663 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:38:30,664 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:38:30,664 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:38:30,664 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:38:30,664 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:38:30,664 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:38:30,664 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:38:30,664 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:38:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:38:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:38:30,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:30,691 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] [2020-11-07 00:38:30,692 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:38:30,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:30,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2139801528] [2020-11-07 00:38:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:30,801 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:31,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:31,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:31,226 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 00:38:31,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2139801528] [2020-11-07 00:38:31,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:31,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:38:31,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793792011] [2020-11-07 00:38:31,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:38:31,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:31,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:38:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:38:31,255 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:38:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:31,720 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 00:38:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:38:31,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:38:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:31,734 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:38:31,734 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:38:31,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:38:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:38:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:38:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:38:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:38:31,806 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:38:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:31,806 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:38:31,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:38:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:38:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:38:31,809 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:31,810 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] [2020-11-07 00:38:31,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:38:31,810 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:38:31,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:31,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1237055802] [2020-11-07 00:38:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:31,815 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:31,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:31,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:31,949 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 00:38:31,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1237055802] [2020-11-07 00:38:31,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:31,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:38:31,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017604056] [2020-11-07 00:38:31,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:38:31,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:31,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:38:31,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:38:31,953 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:38:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:32,299 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:38:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:38:32,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:38:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:32,302 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:38:32,302 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:38:32,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:38:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:38:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:38:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:38:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:38:32,322 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:38:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:32,323 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:38:32,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:38:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:38:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:38:32,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:32,326 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:38:32,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:38:32,326 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:38:32,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:32,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203356203] [2020-11-07 00:38:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:32,331 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:32,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:32,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:32,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:32,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:38:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:38:32,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203356203] [2020-11-07 00:38:32,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:32,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:38:32,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580865983] [2020-11-07 00:38:32,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:38:32,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:38:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:38:32,500 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2020-11-07 00:38:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:32,971 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:38:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:38:32,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-11-07 00:38:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:32,975 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:38:32,975 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:38:32,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:38:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:38:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:38:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:38:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:38:32,993 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:38:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:32,994 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:38:32,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:38:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:38:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:38:32,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:32,996 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2020-11-07 00:38:32,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:38:32,997 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:38:32,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:32,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054049920] [2020-11-07 00:38:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:33,001 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:33,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:33,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:33,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:33,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:38:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:38:33,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054049920] [2020-11-07 00:38:33,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:33,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:38:33,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717131106] [2020-11-07 00:38:33,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:38:33,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:33,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:38:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:38:33,246 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 10 states. [2020-11-07 00:38:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:34,217 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2020-11-07 00:38:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:38:34,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-11-07 00:38:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:34,225 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:38:34,225 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:38:34,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:38:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:38:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2020-11-07 00:38:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:38:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-11-07 00:38:34,269 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 43 [2020-11-07 00:38:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:34,270 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-11-07 00:38:34,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:38:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-11-07 00:38:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 00:38:34,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:34,275 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:38:34,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:38:34,278 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2122193092, now seen corresponding path program 1 times [2020-11-07 00:38:34,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:34,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466293900] [2020-11-07 00:38:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:34,283 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:34,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:34,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:34,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:34,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:38:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:38:34,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [466293900] [2020-11-07 00:38:34,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:34,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:38:34,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559692330] [2020-11-07 00:38:34,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:38:34,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:34,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:38:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:38:34,486 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-11-07 00:38:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:35,093 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2020-11-07 00:38:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:38:35,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-11-07 00:38:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:35,096 INFO L225 Difference]: With dead ends: 111 [2020-11-07 00:38:35,096 INFO L226 Difference]: Without dead ends: 63 [2020-11-07 00:38:35,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:38:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-07 00:38:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-07 00:38:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 00:38:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2020-11-07 00:38:35,116 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 44 [2020-11-07 00:38:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:35,117 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2020-11-07 00:38:35,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:38:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2020-11-07 00:38:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:38:35,119 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:35,120 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:38:35,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:38:35,120 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:38:35,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:35,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2099828530] [2020-11-07 00:38:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:35,124 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:38:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:38:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:38:35,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2099828530] [2020-11-07 00:38:35,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:35,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:38:35,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284783173] [2020-11-07 00:38:35,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:38:35,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:35,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:38:35,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:38:35,308 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 8 states. [2020-11-07 00:38:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:35,797 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2020-11-07 00:38:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:38:35,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-11-07 00:38:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:35,800 INFO L225 Difference]: With dead ends: 114 [2020-11-07 00:38:35,801 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:38:35,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:38:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:38:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-07 00:38:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 00:38:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2020-11-07 00:38:35,841 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 59 [2020-11-07 00:38:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:35,841 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2020-11-07 00:38:35,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:38:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2020-11-07 00:38:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:38:35,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:35,844 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 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 00:38:35,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:38:35,845 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:38:35,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:35,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779979376] [2020-11-07 00:38:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:35,849 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:35,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:38:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:38:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:38:36,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779979376] [2020-11-07 00:38:36,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:36,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:38:36,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347528337] [2020-11-07 00:38:36,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:38:36,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:38:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:38:36,118 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 9 states. [2020-11-07 00:38:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:36,715 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-11-07 00:38:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:38:36,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2020-11-07 00:38:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:36,720 INFO L225 Difference]: With dead ends: 116 [2020-11-07 00:38:36,721 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:38:36,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:38:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:38:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-07 00:38:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 00:38:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2020-11-07 00:38:36,754 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 60 [2020-11-07 00:38:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:36,755 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2020-11-07 00:38:36,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:38:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2020-11-07 00:38:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:38:36,758 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:38:36,759 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:38:36,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:38:36,759 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:38:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:38:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:38:36,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:38:36,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154724548] [2020-11-07 00:38:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:38:36,763 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:38:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:38:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:38:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:38:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:38:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:38:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:38:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:38:36,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154724548] [2020-11-07 00:38:36,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:38:36,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:38:36,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219331990] [2020-11-07 00:38:36,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:38:36,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:38:36,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:38:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:38:36,939 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 9 states. [2020-11-07 00:38:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:38:37,493 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2020-11-07 00:38:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:38:37,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:38:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:38:37,494 INFO L225 Difference]: With dead ends: 65 [2020-11-07 00:38:37,494 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:38:37,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:38:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:38:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:38:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:38:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:38:37,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-11-07 00:38:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:38:37,497 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:38:37,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:38:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:38:37,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:38:37,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:38:37,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:38:38,771 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2020-11-07 00:38:39,121 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 17 [2020-11-07 00:38:39,225 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 17 [2020-11-07 00:38:39,558 WARN L194 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 20 [2020-11-07 00:38:39,865 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2020-11-07 00:38:40,155 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 20 [2020-11-07 00:38:40,503 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2020-11-07 00:38:40,629 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,629 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,630 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,631 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 00:38:40,631 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,631 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,631 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:38:40,631 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,631 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,631 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,642 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,642 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:38:40,643 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-11-07 00:38:40,643 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (= main_~x~0 2) [2020-11-07 00:38:40,643 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (= main_~x~0 2) [2020-11-07 00:38:40,643 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 00:38:40,643 INFO L262 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= main_~result~0 1) (= main_~x~0 2) (< 0 main_~result~0)) [2020-11-07 00:38:40,643 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 00:38:40,643 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (= main_~x~0 2) [2020-11-07 00:38:40,644 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= |main_#t~ret11| 1) (= main_~x~0 2)) [2020-11-07 00:38:40,644 INFO L262 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (= main_~x~0 2) [2020-11-07 00:38:40,644 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= |main_#t~ret11| 1) (= main_~x~0 2)) [2020-11-07 00:38:40,644 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= main_~result~0 1) (<= |main_#t~ret11| 1) (= main_~x~0 2) (< 0 main_~result~0)) [2020-11-07 00:38:40,644 INFO L269 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-11-07 00:38:40,645 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,645 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,645 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1)) [2020-11-07 00:38:40,645 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,645 INFO L262 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-11-07 00:38:40,646 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,646 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-11-07 00:38:40,646 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,646 INFO L262 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-11-07 00:38:40,646 INFO L262 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,647 INFO L262 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:38:40,647 INFO L262 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (< 1 fibo2_~n)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)))) (or (<= 1 |fibo2_#in~n|) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))) [2020-11-07 00:38:40,647 INFO L262 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (< 1 fibo2_~n)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)))) (or (<= 1 |fibo2_#in~n|) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))) [2020-11-07 00:38:40,647 INFO L269 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-11-07 00:38:40,647 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:38:40,647 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret7|) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0) (and .cse0 (<= 3 |fibo1_#in~n|)))) [2020-11-07 00:38:40,648 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:38:40,648 INFO L262 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret7|) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0) (and .cse0 (<= 3 |fibo1_#in~n|)))) [2020-11-07 00:38:40,648 INFO L262 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-11-07 00:38:40,648 INFO L262 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse1) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= .cse1 1))))) [2020-11-07 00:38:40,648 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:38:40,648 INFO L262 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse1) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= .cse1 1))))) [2020-11-07 00:38:40,649 INFO L262 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 1) .cse0))) [2020-11-07 00:38:40,649 INFO L262 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-11-07 00:38:40,649 INFO L262 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse1) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= |fibo1_#res| 1) (<= .cse1 1) (<= 1 |fibo1_#res|))))) [2020-11-07 00:38:40,649 INFO L262 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 1 |fibo1_#t~ret7|) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) [2020-11-07 00:38:40,650 INFO L262 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 1) .cse0))) [2020-11-07 00:38:40,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:38:40 BoogieIcfgContainer [2020-11-07 00:38:40,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:38:40,690 INFO L168 Benchmark]: Toolchain (without parser) took 11282.53 ms. Allocated memory was 157.3 MB in the beginning and 272.6 MB in the end (delta: 115.3 MB). Free memory was 133.8 MB in the beginning and 252.5 MB in the end (delta: -118.7 MB). Peak memory consumption was 127.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:38:40,691 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 104.2 MB in the beginning and 104.1 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:38:40,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.42 ms. Allocated memory is still 157.3 MB. Free memory was 133.0 MB in the beginning and 123.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:38:40,703 INFO L168 Benchmark]: Boogie Preprocessor took 73.21 ms. Allocated memory is still 157.3 MB. Free memory was 123.2 MB in the beginning and 121.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:38:40,704 INFO L168 Benchmark]: RCFGBuilder took 746.48 ms. Allocated memory is still 157.3 MB. Free memory was 121.9 MB in the beginning and 106.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:38:40,706 INFO L168 Benchmark]: TraceAbstraction took 10098.58 ms. Allocated memory was 157.3 MB in the beginning and 272.6 MB in the end (delta: 115.3 MB). Free memory was 106.1 MB in the beginning and 252.5 MB in the end (delta: -146.3 MB). Peak memory consumption was 100.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:38:40,709 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.24 ms. Allocated memory is still 125.8 MB. Free memory was 104.2 MB in the beginning and 104.1 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 340.42 ms. Allocated memory is still 157.3 MB. Free memory was 133.0 MB in the beginning and 123.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 73.21 ms. Allocated memory is still 157.3 MB. Free memory was 123.2 MB in the beginning and 121.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 746.48 ms. Allocated memory is still 157.3 MB. Free memory was 121.9 MB in the beginning and 106.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10098.58 ms. Allocated memory was 157.3 MB in the beginning and 272.6 MB in the end (delta: 115.3 MB). Free memory was 106.1 MB in the beginning and 252.5 MB in the end (delta: -146.3 MB). Peak memory consumption was 100.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: x == 2 - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((n == \old(n) && 1 < n) || ((1 <= \result && \result <= 1) && n == \old(n))) || (n == \old(n) && \old(n) <= 0)) && (1 <= \old(n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((n == \old(n) && 3 <= \old(n)) || ((n == \old(n) && \result <= 1) && 1 <= \result)) || (\old(n) <= 1 && n == \old(n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.8s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 383 SDtfs, 483 SDslu, 635 SDs, 0 SdLazy, 1490 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, 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, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 407 PreInvPairs, 557 NumberOfFragments, 513 HoareAnnotationTreeSize, 407 FomulaSimplifications, 12345 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 57 FomulaSimplificationsInter, 3552 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...