java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:13:15,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:13:15,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:13:15,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:13:15,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:13:15,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:13:15,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:13:15,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:13:15,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:13:15,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:13:15,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:13:15,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:13:15,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:13:15,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:13:15,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:13:15,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:13:15,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:13:15,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:13:15,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:13:15,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:13:15,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:13:15,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:13:15,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:13:15,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:13:15,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:13:15,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:13:15,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:13:15,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:13:15,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:13:15,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:13:15,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:13:15,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:13:15,793 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:13:15,793 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:13:15,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:13:15,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:13:15,795 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:13:15,815 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:13:15,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:13:15,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:13:15,819 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:13:15,819 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:13:15,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:13:15,820 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:13:15,820 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:13:15,820 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:13:15,820 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:13:15,820 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:13:15,821 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:13:15,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:13:15,822 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:13:15,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:13:15,822 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:13:15,822 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:13:15,823 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:13:15,823 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:13:15,823 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:13:15,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:13:15,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:13:15,824 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:13:15,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:13:15,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:13:15,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:13:15,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:13:15,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:13:15,826 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:13:15,826 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:13:15,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:13:15,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:13:15,827 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:13:15,827 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:13:15,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:13:15,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:13:15,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:13:15,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:13:15,908 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:13:15,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-24 12:13:15,963 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ffb3d0c88/302a3fdaab464536a7e41ac7464f4450/FLAG39736cd4a [2018-10-24 12:13:16,369 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:13:16,370 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-24 12:13:16,376 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ffb3d0c88/302a3fdaab464536a7e41ac7464f4450/FLAG39736cd4a [2018-10-24 12:13:16,393 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ffb3d0c88/302a3fdaab464536a7e41ac7464f4450 [2018-10-24 12:13:16,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:13:16,404 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:13:16,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:13:16,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:13:16,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:13:16,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef17d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16, skipping insertion in model container [2018-10-24 12:13:16,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:13:16,443 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:13:16,649 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:13:16,660 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:13:16,699 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:13:16,716 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:13:16,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16 WrapperNode [2018-10-24 12:13:16,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:13:16,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:13:16,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:13:16,718 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:13:16,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:13:16,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:13:16,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:13:16,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:13:16,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... [2018-10-24 12:13:16,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:13:16,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:13:16,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:13:16,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:13:16,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:13:16,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:13:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:13:16,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:13:16,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:13:16,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:13:16,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:13:16,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:13:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:13:17,399 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:13:17,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:17 BoogieIcfgContainer [2018-10-24 12:13:17,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:13:17,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:13:17,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:13:17,404 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:13:17,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:13:16" (1/3) ... [2018-10-24 12:13:17,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47763ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:13:17, skipping insertion in model container [2018-10-24 12:13:17,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:16" (2/3) ... [2018-10-24 12:13:17,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47763ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:13:17, skipping insertion in model container [2018-10-24 12:13:17,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:17" (3/3) ... [2018-10-24 12:13:17,408 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-10-24 12:13:17,418 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:13:17,427 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:13:17,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:13:17,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:13:17,477 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:13:17,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:13:17,477 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:13:17,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:13:17,478 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:13:17,478 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:13:17,478 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:13:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-24 12:13:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-24 12:13:17,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:17,511 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:17,513 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:17,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-10-24 12:13:17,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:17,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:17,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:17,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:17,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:17,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:13:17,631 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:17,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:13:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:13:17,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:13:17,654 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-24 12:13:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:17,676 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-10-24 12:13:17,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:13:17,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-24 12:13:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:17,685 INFO L225 Difference]: With dead ends: 39 [2018-10-24 12:13:17,685 INFO L226 Difference]: Without dead ends: 22 [2018-10-24 12:13:17,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:13:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-24 12:13:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-24 12:13:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-24 12:13:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-10-24 12:13:17,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-10-24 12:13:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:17,724 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-10-24 12:13:17,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:13:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-10-24 12:13:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-24 12:13:17,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:17,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:17,726 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:17,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-10-24 12:13:17,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:17,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:17,729 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:17,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:17,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:13:17,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:17,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:13:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:13:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:17,848 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-10-24 12:13:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:18,059 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-10-24 12:13:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:13:18,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-24 12:13:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:18,062 INFO L225 Difference]: With dead ends: 30 [2018-10-24 12:13:18,063 INFO L226 Difference]: Without dead ends: 25 [2018-10-24 12:13:18,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-24 12:13:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-24 12:13:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-24 12:13:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-24 12:13:18,071 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-10-24 12:13:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:18,071 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-24 12:13:18,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:13:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-24 12:13:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:13:18,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:18,073 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:18,073 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:18,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:18,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-10-24 12:13:18,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:18,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:18,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:18,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:18,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:20,278 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-10-24 12:13:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:20,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:20,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:13:20,283 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:20,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:13:20,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:13:20,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:20,284 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-10-24 12:13:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:20,690 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-10-24 12:13:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:13:20,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-24 12:13:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:20,693 INFO L225 Difference]: With dead ends: 54 [2018-10-24 12:13:20,693 INFO L226 Difference]: Without dead ends: 37 [2018-10-24 12:13:20,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-24 12:13:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-24 12:13:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-24 12:13:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-10-24 12:13:20,706 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-10-24 12:13:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:20,706 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-10-24 12:13:20,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:13:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-10-24 12:13:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:13:20,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:20,707 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:20,709 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:20,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-10-24 12:13:20,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:20,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:20,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:21,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:21,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:13:21,526 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-24 12:13:21,528 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-10-24 12:13:21,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:13:21,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:13:21,688 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:13:22,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:13:22,611 INFO L272 AbstractInterpreter]: Visited 22 different actions 133 times. Merged at 13 different actions 89 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-10-24 12:13:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:22,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:13:22,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:22,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:13:22,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:22,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:13:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:22,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:13:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:22,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:13:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:24,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:13:24,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-10-24 12:13:24,875 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:13:24,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:13:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:13:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:13:24,878 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-10-24 12:13:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:25,340 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-10-24 12:13:25,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:13:25,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-10-24 12:13:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:25,345 INFO L225 Difference]: With dead ends: 54 [2018-10-24 12:13:25,345 INFO L226 Difference]: Without dead ends: 49 [2018-10-24 12:13:25,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:13:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-24 12:13:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-24 12:13:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:13:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-10-24 12:13:25,353 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-10-24 12:13:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:25,354 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-10-24 12:13:25,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:13:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-10-24 12:13:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:13:25,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:25,355 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:25,355 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:25,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-10-24 12:13:25,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:25,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:25,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:25,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:25,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:13:25,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:25,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:13:25,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:13:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:25,421 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-10-24 12:13:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:25,539 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-10-24 12:13:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:13:25,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-24 12:13:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:25,546 INFO L225 Difference]: With dead ends: 66 [2018-10-24 12:13:25,546 INFO L226 Difference]: Without dead ends: 49 [2018-10-24 12:13:25,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-24 12:13:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-24 12:13:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:13:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-24 12:13:25,557 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-10-24 12:13:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:25,557 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-24 12:13:25,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:13:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-24 12:13:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:13:25,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:25,558 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:25,559 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:25,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-10-24 12:13:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:25,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:30,013 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-24 12:13:40,138 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-10-24 12:13:42,165 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-24 12:13:54,311 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2018-10-24 12:13:56,324 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-24 12:13:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:56,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:13:56,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-24 12:13:56,358 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-10-24 12:13:56,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:13:56,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:13:56,365 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:13:56,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:13:56,419 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-10-24 12:13:56,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:56,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:13:56,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:56,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:13:56,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:56,477 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:13:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:56,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:13:57,035 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-10-24 12:13:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:57,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:13:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:13:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 19 [2018-10-24 12:13:57,974 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:13:57,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:13:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:13:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=197, Unknown=10, NotChecked=90, Total=342 [2018-10-24 12:13:57,976 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 15 states. [2018-10-24 12:14:00,206 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-24 12:14:16,357 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse12 (* (- 2) .cse14))) (let ((.cse0 (* 2 .cse14)) (.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse11 (div (+ c_main_~y~0 .cse12) 4294967296))) (let ((.cse6 (* 4294967296 .cse11)) (.cse3 (<= .cse13 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse13)) (.cse9 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296)) (.cse7 (or .cse2 .cse3)) (.cse8 (<= (+ .cse0 .cse6 1) c_main_~y~0))) (and (let ((.cse1 (* 4294967296 .cse9))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 .cse8))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse11) .cse7)) .cse8)))))) is different from false [2018-10-24 12:14:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:14:16,401 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-10-24 12:14:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:14:16,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-10-24 12:14:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:14:16,404 INFO L225 Difference]: With dead ends: 67 [2018-10-24 12:14:16,404 INFO L226 Difference]: Without dead ends: 36 [2018-10-24 12:14:16,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=55, Invalid=225, Unknown=12, NotChecked=170, Total=462 [2018-10-24 12:14:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-24 12:14:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-24 12:14:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-24 12:14:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-24 12:14:16,412 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-10-24 12:14:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:14:16,412 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-24 12:14:16,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:14:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-24 12:14:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 12:14:16,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:14:16,414 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:14:16,414 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:14:16,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:14:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-10-24 12:14:16,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:14:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:14:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:16,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:14:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:14:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:16,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:16,980 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:14:16,980 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:14:16,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:14:16,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:16,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:14:16,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:14:16,994 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:14:17,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:14:17,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:14:17,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:14:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:17,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:14:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:30,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:14:30,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-10-24 12:14:30,706 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:14:30,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:14:30,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:14:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:14:30,708 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-10-24 12:14:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:14:31,403 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-24 12:14:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 12:14:31,410 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-10-24 12:14:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:14:31,410 INFO L225 Difference]: With dead ends: 54 [2018-10-24 12:14:31,410 INFO L226 Difference]: Without dead ends: 49 [2018-10-24 12:14:31,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:14:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-24 12:14:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-24 12:14:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:14:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-24 12:14:31,418 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-10-24 12:14:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:14:31,418 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-24 12:14:31,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:14:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-24 12:14:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-24 12:14:31,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:14:31,420 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:14:31,420 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:14:31,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:14:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-10-24 12:14:31,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:14:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:31,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:14:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:31,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:14:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:14:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:32,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:32,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:14:32,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:14:32,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:14:32,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:32,609 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:14:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:14:32,617 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:14:32,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:14:32,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:14:32,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:14:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:32,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:14:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:55,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:14:55,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-10-24 12:14:55,610 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:14:55,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 12:14:55,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 12:14:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-10-24 12:14:55,614 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-10-24 12:14:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:14:56,531 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-24 12:14:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 12:14:56,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-10-24 12:14:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:14:56,533 INFO L225 Difference]: With dead ends: 66 [2018-10-24 12:14:56,533 INFO L226 Difference]: Without dead ends: 61 [2018-10-24 12:14:56,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-10-24 12:14:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-24 12:14:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-24 12:14:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-24 12:14:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-24 12:14:56,541 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-10-24 12:14:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:14:56,541 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-24 12:14:56,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 12:14:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-24 12:14:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-24 12:14:56,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:14:56,543 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:14:56,543 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:14:56,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:14:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-10-24 12:14:56,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:14:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:56,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:14:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:14:56,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:14:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:14:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:57,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:57,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:14:57,997 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:14:57,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:14:57,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:14:57,998 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:14:58,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:14:58,006 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:14:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:14:58,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:14:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:14:58,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:15:22,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:15:22,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-10-24 12:15:22,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:15:22,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-24 12:15:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-24 12:15:22,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-10-24 12:15:22,653 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-10-24 12:15:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:24,622 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-24 12:15:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-24 12:15:24,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-10-24 12:15:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:24,623 INFO L225 Difference]: With dead ends: 78 [2018-10-24 12:15:24,623 INFO L226 Difference]: Without dead ends: 73 [2018-10-24 12:15:24,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-10-24 12:15:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-24 12:15:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-24 12:15:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-24 12:15:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-24 12:15:24,632 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-10-24 12:15:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:24,632 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-24 12:15:24,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-24 12:15:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-24 12:15:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-24 12:15:24,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:24,634 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:15:24,634 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-10-24 12:15:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:24,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:25,337 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-10-24 12:15:27,594 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:29,785 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:31,923 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:36,007 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:40,166 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:42,267 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:44,344 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:46,421 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:48,551 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:50,655 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:53,031 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:55,141 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:15:57,374 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:01,600 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:03,840 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:05,986 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:10,119 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:12,258 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:16,401 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:18,666 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:20,788 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:22,916 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:27,064 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:29,342 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:31,524 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:33,819 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:35,972 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:38,119 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:40,279 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:42,430 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:46,607 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:48,763 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:50,922 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:53,256 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:55,423 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 12:16:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:16:56,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:56,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:56,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:16:56,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:16:56,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:56,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:16:56,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:16:56,178 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:17:01,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:17:01,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:17:01,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:17:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:06,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:17:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-24 12:17:16,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:17:16,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 108 [2018-10-24 12:17:16,880 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:17:16,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-24 12:17:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-24 12:17:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=11142, Unknown=0, NotChecked=0, Total=11556 [2018-10-24 12:17:16,884 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 104 states. [2018-10-24 12:17:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:17:19,317 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-24 12:17:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-24 12:17:19,317 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 71 [2018-10-24 12:17:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:17:19,318 INFO L225 Difference]: With dead ends: 87 [2018-10-24 12:17:19,318 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:17:19,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 38 SyntacticMatches, 53 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=420, Invalid=11352, Unknown=0, NotChecked=0, Total=11772 [2018-10-24 12:17:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:17:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:17:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:17:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:17:19,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-10-24 12:17:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:17:19,324 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:17:19,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-24 12:17:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:17:19,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:17:19,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:17:19,523 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-24 12:17:25,618 WARN L179 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2018-10-24 12:17:25,621 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:17:25,622 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,622 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse1 (* 2 .cse3)) (.cse2 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (<= .cse0 0) (<= (+ .cse1 .cse2 1) main_~y~0))) (and (<= main_~y~0 (+ .cse1 .cse2)) (<= (+ .cse1 main_~x~0 .cse2) (+ main_~y~0 100)) (<= 100 main_~x~0))))) [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-10-24 12:17:25,623 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-10-24 12:17:25,623 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-24 12:17:25,624 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-24 12:17:25,624 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:17:25,624 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-24 12:17:25,624 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-24 12:17:25,624 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:17:25,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:17:25 BoogieIcfgContainer [2018-10-24 12:17:25,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:17:25,640 INFO L168 Benchmark]: Toolchain (without parser) took 249236.68 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 914.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -733.4 MB). Peak memory consumption was 181.5 MB. Max. memory is 7.1 GB. [2018-10-24 12:17:25,642 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:17:25,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-24 12:17:25,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:17:25,643 INFO L168 Benchmark]: Boogie Preprocessor took 47.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:17:25,644 INFO L168 Benchmark]: RCFGBuilder took 599.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:17:25,645 INFO L168 Benchmark]: TraceAbstraction took 248238.42 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 57.5 MB). Peak memory consumption was 220.5 MB. Max. memory is 7.1 GB. [2018-10-24 12:17:25,649 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 599.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248238.42 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 57.5 MB). Peak memory consumption was 220.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 248.1s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 25.7s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 1953 SDs, 0 SdLazy, 7256 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 307 SyntacticMatches, 70 SemanticMatches, 338 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 225.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 357 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 208.6s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 819 ConstructedInterpolants, 63 QuantifiedInterpolants, 474513 SizeOfPredicates, 10 NumberOfNonLiveVariables, 812 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 124/820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...