java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:33:23,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:33:23,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:33:23,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:33:23,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:33:23,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:33:23,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:33:23,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:33:23,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:33:23,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:33:23,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:33:23,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:33:23,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:33:23,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:33:23,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:33:23,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:33:23,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:33:23,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:33:23,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:33:23,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:33:23,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:33:23,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:33:23,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:33:23,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:33:23,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:33:23,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:33:23,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:33:23,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:33:23,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:33:23,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:33:23,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:33:23,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:33:23,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:33:23,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:33:23,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:33:23,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:33:23,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:33:23,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:33:23,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:33:23,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:33:23,728 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:33:23,728 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:33:23,728 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:33:23,729 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:33:23,729 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:33:23,729 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:33:23,729 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:33:23,729 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:33:23,730 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:33:23,730 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:33:23,731 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:33:23,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:33:23,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:33:23,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:33:23,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:33:23,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:33:23,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:33:23,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:33:23,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:33:23,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:33:23,735 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:33:23,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:33:23,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:33:23,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:33:23,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:33:23,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:33:23,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:33:23,736 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:33:23,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:33:23,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:33:23,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:33:23,737 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:33:23,737 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:33:23,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:33:23,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:33:23,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:33:23,809 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:33:23,809 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:33:23,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-07 10:33:23,878 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2807b9e/08ff64d28b1449ca8bbdf45334933ddb/FLAGcfe329b84 [2018-11-07 10:33:24,380 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:33:24,381 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-07 10:33:24,389 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2807b9e/08ff64d28b1449ca8bbdf45334933ddb/FLAGcfe329b84 [2018-11-07 10:33:24,411 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2807b9e/08ff64d28b1449ca8bbdf45334933ddb [2018-11-07 10:33:24,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:33:24,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:33:24,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:33:24,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:33:24,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:33:24,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50328a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24, skipping insertion in model container [2018-11-07 10:33:24,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:33:24,482 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:33:24,699 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:33:24,706 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:33:24,732 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:33:24,747 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:33:24,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24 WrapperNode [2018-11-07 10:33:24,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:33:24,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:33:24,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:33:24,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:33:24,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:33:24,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:33:24,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:33:24,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:33:24,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... [2018-11-07 10:33:24,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:33:24,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:33:24,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:33:24,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:33:24,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:33:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:33:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:33:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:33:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:33:24,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:33:24,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:33:24,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:33:24,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:33:25,484 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:33:25,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:25 BoogieIcfgContainer [2018-11-07 10:33:25,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:33:25,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:33:25,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:33:25,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:33:25,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:33:24" (1/3) ... [2018-11-07 10:33:25,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f24499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:25, skipping insertion in model container [2018-11-07 10:33:25,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:24" (2/3) ... [2018-11-07 10:33:25,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f24499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:25, skipping insertion in model container [2018-11-07 10:33:25,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:25" (3/3) ... [2018-11-07 10:33:25,494 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-07 10:33:25,504 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:33:25,513 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:33:25,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:33:25,566 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:33:25,567 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:33:25,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:33:25,567 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:33:25,567 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:33:25,567 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:33:25,567 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:33:25,568 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:33:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-07 10:33:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:33:25,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:25,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:25,597 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:25,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-07 10:33:25,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:25,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:25,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:25,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:25,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:25,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:33:25,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:33:25,721 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:25,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:33:25,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:33:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:33:25,744 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-07 10:33:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:25,767 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-07 10:33:25,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:33:25,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:33:25,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:25,779 INFO L225 Difference]: With dead ends: 39 [2018-11-07 10:33:25,779 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:33:25,783 INFO L604 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-11-07 10:33:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:33:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 10:33:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 10:33:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-07 10:33:25,819 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-07 10:33:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:25,820 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-07 10:33:25,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:33:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-07 10:33:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:33:25,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:25,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:25,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:25,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-07 10:33:25,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:25,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:25,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:33:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:33:25,955 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:33:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:33:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:33:25,958 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-07 10:33:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:26,161 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-07 10:33:26,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:33:26,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 10:33:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:26,165 INFO L225 Difference]: With dead ends: 30 [2018-11-07 10:33:26,165 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 10:33:26,166 INFO L604 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-11-07 10:33:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 10:33:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-07 10:33:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 10:33:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-07 10:33:26,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-07 10:33:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:26,173 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-07 10:33:26,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:33:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-07 10:33:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:33:26,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:26,174 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-11-07 10:33:26,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:26,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-07 10:33:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:26,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:26,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:26,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:33:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:33:26,346 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:26,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:33:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:33:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:33:26,348 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-07 10:33:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:26,669 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-07 10:33:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:33:26,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-07 10:33:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:26,671 INFO L225 Difference]: With dead ends: 54 [2018-11-07 10:33:26,673 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:33:26,674 INFO L604 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-11-07 10:33:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:33:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 10:33:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 10:33:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-07 10:33:26,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-07 10:33:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:26,683 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-07 10:33:26,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:33:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-07 10:33:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:33:26,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:26,685 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-11-07 10:33:26,685 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:26,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-07 10:33:26,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:26,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:26,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:26,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:26,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:27,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:27,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:27,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 10:33:27,490 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-11-07 10:33:27,530 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:33:27,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:33:28,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:33:28,061 INFO L272 AbstractInterpreter]: Visited 22 different actions 57 times. Merged at 13 different actions 29 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 10:33:28,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:28,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:33:28,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:28,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 10:33:28,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:28,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:28,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:28,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 10:33:29,746 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:29,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:33:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:33:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:33:29,750 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-11-07 10:33:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:30,554 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-07 10:33:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:33:30,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-07 10:33:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:30,559 INFO L225 Difference]: With dead ends: 54 [2018-11-07 10:33:30,559 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 10:33:30,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:33:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 10:33:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 10:33:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:33:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-07 10:33:30,569 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-07 10:33:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:30,570 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-07 10:33:30,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:33:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-07 10:33:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:33:30,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:30,571 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-11-07 10:33:30,572 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:30,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-07 10:33:30,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:30,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:30,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:32,650 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-11-07 10:33:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:32,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:33:32,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:33:32,654 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:32,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:33:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:33:32,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:33:32,655 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-07 10:33:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:32,751 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-07 10:33:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:33:32,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-07 10:33:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:32,757 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:33:32,757 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 10:33:32,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:33:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 10:33:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 10:33:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:33:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-07 10:33:32,765 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-07 10:33:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:32,766 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-07 10:33:32,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:33:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-07 10:33:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:33:32,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:32,767 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-11-07 10:33:32,767 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:32,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-07 10:33:32,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:32,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:32,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:32,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:32,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:35,166 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-07 10:33:37,186 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-11-07 10:33:39,217 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 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 10:33:41,236 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-11-07 10:33:43,261 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) (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-11-07 10:33:45,279 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-11-07 10:33:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-07 10:33:45,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:45,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:45,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 10:33:45,316 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-11-07 10:33:45,318 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:33:45,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:33:45,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:33:45,418 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-11-07 10:33:45,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:45,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:33:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:45,445 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 10:33:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:45,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:45,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:45,958 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-11-07 10:33:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:46,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:46,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 22 [2018-11-07 10:33:46,747 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:46,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:33:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:33:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=207, Unknown=6, NotChecked=198, Total=462 [2018-11-07 10:33:46,749 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2018-11-07 10:33:48,918 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-07 10:33:50,951 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-11-07 10:33:53,010 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 3) (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)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 10:33:55,020 WARN L854 $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 3) (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)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-07 10:33:57,069 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) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 10:33:59,092 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) (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)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 10:34:01,101 WARN L854 $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) (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)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-07 10:34:03,149 WARN L854 $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)) (not (= (mod c_main_~y~0 2) 0)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-07 10:34:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:03,361 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-07 10:34:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:34:03,361 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-07 10:34:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:03,362 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:34:03,362 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 10:34:03,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=14, NotChecked=492, Total=812 [2018-11-07 10:34:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 10:34:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-07 10:34:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 10:34:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-07 10:34:03,372 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 23 [2018-11-07 10:34:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:03,372 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-07 10:34:03,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:34:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-07 10:34:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:34:03,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:03,374 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-11-07 10:34:03,375 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:03,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-11-07 10:34:03,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:03,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:03,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:03,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:04,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:04,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:04,294 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:04,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:04,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:04,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 10:34:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:34:04,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:34:04,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:34:04,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:04,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:04,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:08,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:08,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 10:34:08,146 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:08,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:34:08,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:34:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:34:08,149 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 23 states. [2018-11-07 10:34:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:08,917 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-07 10:34:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:34:08,919 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-07 10:34:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:08,920 INFO L225 Difference]: With dead ends: 77 [2018-11-07 10:34:08,921 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 10:34:08,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:34:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 10:34:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-07 10:34:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 10:34:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-07 10:34:08,930 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 35 [2018-11-07 10:34:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:08,930 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-07 10:34:08,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:34:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-07 10:34:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:34:08,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:08,932 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-11-07 10:34:08,932 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:08,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:08,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1509590180, now seen corresponding path program 2 times [2018-11-07 10:34:08,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:08,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:08,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:09,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:09,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:09,329 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:09,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:09,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:09,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 10:34:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:34:09,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:34:21,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:34:21,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:21,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:21,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:21,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:21,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 10:34:21,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:21,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:34:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:34:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:34:21,928 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 8 states. [2018-11-07 10:34:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:22,463 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-07 10:34:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:34:22,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-07 10:34:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:22,465 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:34:22,465 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 10:34:22,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:34:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 10:34:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 10:34:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:34:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 10:34:22,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-11-07 10:34:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:22,471 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 10:34:22,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:34:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 10:34:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:34:22,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:22,473 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-11-07 10:34:22,473 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:22,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-11-07 10:34:22,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:22,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:22,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:24,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:24,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:24,385 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:24,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:24,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:24,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 10:34:24,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:34:24,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:34:24,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:34:24,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:24,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:24,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:28,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:28,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 10:34:28,364 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:28,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:34:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:34:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 10:34:28,367 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-11-07 10:34:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:29,287 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 10:34:29,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:34:29,287 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-07 10:34:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:29,289 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:34:29,289 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 10:34:29,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 10:34:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 10:34:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 10:34:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:34:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 10:34:29,297 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-11-07 10:34:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:29,297 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 10:34:29,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:34:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 10:34:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:34:29,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:29,298 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-11-07 10:34:29,299 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:29,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-11-07 10:34:29,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:29,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:29,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:30,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:30,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:30,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:30,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:30,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:30,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 10:34:30,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:30,660 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:34:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:30,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:30,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:34,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:34,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 10:34:34,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:34,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:34:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:34:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 10:34:34,958 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-11-07 10:34:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:37,070 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 10:34:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:34:37,071 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-11-07 10:34:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:37,072 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:34:37,072 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 10:34:37,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 10:34:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 10:34:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 10:34:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 10:34:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 10:34:37,081 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-11-07 10:34:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:37,081 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 10:34:37,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:34:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 10:34:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:34:37,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:37,083 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-11-07 10:34:37,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:37,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-11-07 10:34:37,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:37,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:37,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:37,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:37,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:37,798 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-11-07 10:34:38,212 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-11-07 10:34:40,357 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:42,533 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:44,612 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:44,844 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:46,918 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:48,994 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:53,083 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:57,487 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:34:59,601 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:05,723 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:05,922 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:08,297 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:12,669 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:14,949 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:17,084 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:21,221 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:27,372 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:29,919 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:36,544 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:39,118 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:41,287 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:43,753 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:46,089 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:50,438 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:54,620 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 10:35:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:55,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:55,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:55,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:55,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:55,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:55,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:55,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:35:55,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:35:55,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:35:55,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:35:55,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:00,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:36:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:10,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 108 [2018-11-07 10:36:10,909 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:10,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-07 10:36:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-07 10:36:10,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=11142, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 10:36:10,913 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 104 states. [2018-11-07 10:36:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:13,817 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-07 10:36:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 10:36:13,818 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 71 [2018-11-07 10:36:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:13,819 INFO L225 Difference]: With dead ends: 87 [2018-11-07 10:36:13,819 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:36:13,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 38 SyntacticMatches, 53 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 93.3s TimeCoverageRelationStatistics Valid=420, Invalid=11352, Unknown=0, NotChecked=0, Total=11772 [2018-11-07 10:36:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:36:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:36:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:36:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:36:13,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-07 10:36:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:13,824 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:36:13,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-07 10:36:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:36:13,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:36:13,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:36:16,087 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2018-11-07 10:36:22,159 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 29 [2018-11-07 10:36:22,161 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 10:36:22,161 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:36:22,161 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:36:22,161 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:36:22,161 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:36:22,161 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:36:22,162 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 ((.cse2 (+ .cse3 main_~x~0 .cse4)) (.cse1 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (not (= (mod main_~y~0 2) 0)) (<= .cse0 0))) (and (<= 20 main_~x~0) .cse1 (<= main_~x~0 20)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse1) (and (<= .cse2 (+ main_~y~0 100)) .cse1 (<= 100 main_~x~0)) (and (<= .cse2 (+ main_~y~0 40)) .cse1 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse1))))) [2018-11-07 10:36:22,162 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,162 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-07 10:36:22,162 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,162 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,162 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,162 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (not (= (mod main_~y~0 2) 0)) (<= .cse0 0))) (let ((.cse3 (div main_~y~0 2))) (let ((.cse1 (* 2 .cse3)) (.cse2 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (and (<= main_~y~0 (+ .cse1 .cse2)) (<= (+ .cse1 main_~x~0 .cse2) (+ main_~y~0 100)) (<= 100 main_~x~0))))) [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-07 10:36:22,163 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-07 10:36:22,164 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 10:36:22,164 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:36:22,164 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 10:36:22,164 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 10:36:22,164 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 10:36:22,164 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:36:22,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:36:22 BoogieIcfgContainer [2018-11-07 10:36:22,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:36:22,182 INFO L168 Benchmark]: Toolchain (without parser) took 177756.92 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 910.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.2 MB). Peak memory consumption was 266.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:22,183 INFO L168 Benchmark]: CDTParser took 0.20 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-11-07 10:36:22,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.91 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:22,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.35 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-11-07 10:36:22,185 INFO L168 Benchmark]: Boogie Preprocessor took 27.59 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-11-07 10:36:22,185 INFO L168 Benchmark]: RCFGBuilder took 675.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:22,186 INFO L168 Benchmark]: TraceAbstraction took 176694.69 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 168.3 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 135.3 MB). Peak memory consumption was 303.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:22,191 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.20 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 320.91 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.35 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 27.59 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 675.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176694.69 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 168.3 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 135.3 MB). Peak memory consumption was 303.6 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) || ((0 <= x + 5 && !(y % 2 == 0)) && x + 5 <= 0)) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((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 + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((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, 176.6s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 8.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 245 SDtfs, 27 SDslu, 2177 SDs, 0 SdLazy, 8288 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 378 SyntacticMatches, 66 SemanticMatches, 357 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 143.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 261 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 701 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 12.5s SatisfiabilityAnalysisTime, 128.8s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 921 ConstructedInterpolants, 63 QuantifiedInterpolants, 508703 SizeOfPredicates, 11 NumberOfNonLiveVariables, 901 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 166/868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...