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-INT.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:48:35,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:48:35,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:48:35,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:48:35,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:48:35,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:48:35,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:48:35,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:48:35,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:48:35,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:48:35,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:48:35,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:48:35,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:48:35,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:48:35,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:48:35,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:48:35,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:48:35,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:48:35,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:48:35,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:48:35,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:48:35,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:48:35,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:48:35,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:48:35,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:48:35,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:48:35,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:48:35,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:48:35,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:48:35,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:48:35,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:48:35,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:48:35,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:48:35,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:48:35,706 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:48:35,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:48:35,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:48:35,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:48:35,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:48:35,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:48:35,744 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:48:35,744 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:48:35,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:48:35,745 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:48:35,745 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:48:35,745 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:48:35,745 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:48:35,745 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:48:35,745 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:48:35,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:48:35,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:48:35,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:48:35,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:48:35,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:48:35,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:48:35,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:48:35,749 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:48:35,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:48:35,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:48:35,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:48:35,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:48:35,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:48:35,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:48:35,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:48:35,751 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:48:35,751 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:48:35,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:48:35,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:48:35,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:48:35,752 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:48:35,752 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:48:35,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:48:35,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:48:35,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:48:35,824 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:48:35,825 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:48:35,826 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-07 16:48:35,884 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7300827af/8ec3577133a24c3ebf41ed79f04a5f99/FLAGa3402dafe [2018-11-07 16:48:36,303 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:48:36,305 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-07 16:48:36,312 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7300827af/8ec3577133a24c3ebf41ed79f04a5f99/FLAGa3402dafe [2018-11-07 16:48:36,333 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7300827af/8ec3577133a24c3ebf41ed79f04a5f99 [2018-11-07 16:48:36,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:48:36,347 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:48:36,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:48:36,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:48:36,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:48:36,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9d29b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36, skipping insertion in model container [2018-11-07 16:48:36,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:48:36,395 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:48:36,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:48:36,648 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:48:36,668 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:48:36,682 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:48:36,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36 WrapperNode [2018-11-07 16:48:36,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:48:36,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:48:36,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:48:36,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:48:36,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:48:36,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:48:36,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:48:36,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:48:36,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (1/1) ... [2018-11-07 16:48:36,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:48:36,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:48:36,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:48:36,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:48:36,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (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 16:48:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:48:36,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:48:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-11-07 16:48:36,873 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-11-07 16:48:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:48:36,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:48:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:48:36,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:48:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:48:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:48:37,214 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:48:37,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:37 BoogieIcfgContainer [2018-11-07 16:48:37,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:48:37,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:48:37,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:48:37,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:48:37,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:48:36" (1/3) ... [2018-11-07 16:48:37,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71851306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:37, skipping insertion in model container [2018-11-07 16:48:37,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:36" (2/3) ... [2018-11-07 16:48:37,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71851306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:37, skipping insertion in model container [2018-11-07 16:48:37,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:37" (3/3) ... [2018-11-07 16:48:37,223 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-11-07 16:48:37,233 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:48:37,242 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:48:37,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:48:37,300 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:48:37,300 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:48:37,300 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:48:37,300 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:48:37,300 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:48:37,301 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:48:37,301 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:48:37,301 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:48:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-07 16:48:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:48:37,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:37,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:37,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:37,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-11-07 16:48:37,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,382 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:37,459 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 16:48:37,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:48:37,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:48:37,462 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:37,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:48:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:48:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:48:37,485 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-07 16:48:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:37,507 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-11-07 16:48:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:48:37,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-07 16:48:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:37,518 INFO L225 Difference]: With dead ends: 44 [2018-11-07 16:48:37,518 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 16:48:37,522 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 16:48:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 16:48:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 16:48:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 16:48:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-07 16:48:37,564 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-11-07 16:48:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:37,565 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-07 16:48:37,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:48:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-07 16:48:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:48:37,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:37,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:37,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:37,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:37,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-11-07 16:48:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:37,687 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 16:48:37,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:48:37,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:48:37,688 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:37,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:48:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:48:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:48:37,693 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-07 16:48:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:37,896 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-07 16:48:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:48:37,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-07 16:48:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:37,901 INFO L225 Difference]: With dead ends: 46 [2018-11-07 16:48:37,901 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 16:48:37,903 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 16:48:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 16:48:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-07 16:48:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 16:48:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-07 16:48:37,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-11-07 16:48:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:37,915 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-07 16:48:37,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:48:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-07 16:48:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 16:48:37,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:37,920 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, 1] [2018-11-07 16:48:37,920 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:37,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-11-07 16:48:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:38,009 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 16:48:38,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:38,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:38,011 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 16:48:38,013 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 16:48:38,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:38,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:38,232 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 16:48:38,234 INFO L272 AbstractInterpreter]: Visited 18 different actions 43 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-07 16:48:38,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:38,249 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 16:48:38,325 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 59.8% of their original sizes. [2018-11-07 16:48:38,325 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 16:48:38,460 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-07 16:48:38,460 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 16:48:38,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:48:38,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-07 16:48:38,462 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:38,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:48:38,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:48:38,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:48:38,463 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-07 16:48:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:38,904 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-07 16:48:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:48:38,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 16:48:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:38,909 INFO L225 Difference]: With dead ends: 58 [2018-11-07 16:48:38,909 INFO L226 Difference]: Without dead ends: 41 [2018-11-07 16:48:38,910 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:48:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-07 16:48:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-07 16:48:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:48:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-07 16:48:38,924 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-11-07 16:48:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:38,925 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-07 16:48:38,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:48:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-07 16:48:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 16:48:38,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:38,927 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, 1] [2018-11-07 16:48:38,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:38,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-11-07 16:48:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:38,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:38,931 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:39,024 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 16:48:39,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:39,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:39,025 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 16:48:39,026 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 16:48:39,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:39,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:39,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:39,077 INFO L272 AbstractInterpreter]: Visited 23 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-07 16:48:39,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:39,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:39,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:39,087 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 16:48:39,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:39,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:39,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:39,147 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 16:48:39,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:39,197 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 16:48:39,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:39,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:48:39,219 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:39,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:48:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:48:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:48:39,220 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 4 states. [2018-11-07 16:48:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:39,303 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2018-11-07 16:48:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:48:39,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-07 16:48:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:39,306 INFO L225 Difference]: With dead ends: 66 [2018-11-07 16:48:39,307 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 16:48:39,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:48:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 16:48:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-07 16:48:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:48:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-07 16:48:39,316 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2018-11-07 16:48:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:39,316 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-07 16:48:39,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:48:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-07 16:48:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 16:48:39,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:39,318 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:39,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:39,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:39,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1808032045, now seen corresponding path program 2 times [2018-11-07 16:48:39,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:39,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:39,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:39,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:39,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:39,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:39,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:39,475 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:39,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:39,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:39,476 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 16:48:39,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:39,486 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:39,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:39,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:39,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:48:39,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:48:40,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 16:48:40,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 8] total 18 [2018-11-07 16:48:40,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:40,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:48:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:48:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:48:40,443 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 9 states. [2018-11-07 16:48:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:40,715 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-07 16:48:40,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:48:40,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-07 16:48:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:40,717 INFO L225 Difference]: With dead ends: 62 [2018-11-07 16:48:40,717 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 16:48:40,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:48:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 16:48:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-07 16:48:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 16:48:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-11-07 16:48:40,731 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 28 [2018-11-07 16:48:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:40,731 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-11-07 16:48:40,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:48:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2018-11-07 16:48:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 16:48:40,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:40,733 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:40,733 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:40,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1809879087, now seen corresponding path program 1 times [2018-11-07 16:48:40,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:40,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:40,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:40,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:40,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 16:48:40,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:48:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:48:40,784 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:40,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:48:40,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:48:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:48:40,786 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 4 states. [2018-11-07 16:48:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:40,871 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-07 16:48:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:48:40,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-07 16:48:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:40,875 INFO L225 Difference]: With dead ends: 93 [2018-11-07 16:48:40,875 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 16:48:40,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:48:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 16:48:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-07 16:48:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 16:48:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-07 16:48:40,891 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 28 [2018-11-07 16:48:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:40,891 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-07 16:48:40,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:48:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-07 16:48:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 16:48:40,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:40,893 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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 16:48:40,893 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:40,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-11-07 16:48:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:40,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:40,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:40,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:40,947 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 16:48:40,947 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 16:48:40,950 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:40,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:40,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:40,999 INFO L272 AbstractInterpreter]: Visited 24 different actions 55 times. Merged at 5 different actions 21 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 8 variables. [2018-11-07 16:48:41,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:41,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:41,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:41,013 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 16:48:41,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:41,024 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:41,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:41,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:41,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:41,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:48:41,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:41,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:48:41,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:48:41,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:48:41,164 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2018-11-07 16:48:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:41,257 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2018-11-07 16:48:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:48:41,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-07 16:48:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:41,260 INFO L225 Difference]: With dead ends: 131 [2018-11-07 16:48:41,260 INFO L226 Difference]: Without dead ends: 92 [2018-11-07 16:48:41,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:48:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-07 16:48:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-11-07 16:48:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 16:48:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-07 16:48:41,271 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28 [2018-11-07 16:48:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:41,272 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-07 16:48:41,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:48:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-07 16:48:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:48:41,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:41,273 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:41,274 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:41,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1153463970, now seen corresponding path program 2 times [2018-11-07 16:48:41,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:41,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:41,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:41,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:41,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:41,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:41,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:41,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:41,460 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 16:48:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:41,477 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:41,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:41,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:41,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 16:48:41,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 16:48:41,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 16:48:41,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 20 [2018-11-07 16:48:41,896 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:41,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:48:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:48:41,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:48:41,898 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 9 states. [2018-11-07 16:48:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:42,084 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2018-11-07 16:48:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:48:42,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-07 16:48:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:42,088 INFO L225 Difference]: With dead ends: 94 [2018-11-07 16:48:42,089 INFO L226 Difference]: Without dead ends: 92 [2018-11-07 16:48:42,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:48:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-07 16:48:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-11-07 16:48:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 16:48:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-07 16:48:42,100 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 32 [2018-11-07 16:48:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-07 16:48:42,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:48:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-07 16:48:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:48:42,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:42,102 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:42,102 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:42,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1155311012, now seen corresponding path program 1 times [2018-11-07 16:48:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 16:48:42,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:48:42,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:48:42,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:42,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:48:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:48:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:48:42,140 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 3 states. [2018-11-07 16:48:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:42,215 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-07 16:48:42,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:48:42,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-07 16:48:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:42,218 INFO L225 Difference]: With dead ends: 128 [2018-11-07 16:48:42,218 INFO L226 Difference]: Without dead ends: 90 [2018-11-07 16:48:42,219 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 16:48:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-07 16:48:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-11-07 16:48:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 16:48:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-07 16:48:42,231 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 32 [2018-11-07 16:48:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:42,231 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-07 16:48:42,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:48:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-07 16:48:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:48:42,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:42,233 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:42,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:42,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1098052710, now seen corresponding path program 1 times [2018-11-07 16:48:42,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:42,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:42,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:42,347 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 16:48:42,347 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 16:48:42,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:42,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:42,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:42,393 INFO L272 AbstractInterpreter]: Visited 24 different actions 55 times. Merged at 5 different actions 21 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 8 variables. [2018-11-07 16:48:42,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:42,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:42,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:42,404 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 16:48:42,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:42,414 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:42,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:42,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:42,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:42,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:48:42,557 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:42,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:48:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:48:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:48:42,558 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 6 states. [2018-11-07 16:48:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:42,641 INFO L93 Difference]: Finished difference Result 155 states and 196 transitions. [2018-11-07 16:48:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:48:42,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-07 16:48:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:42,643 INFO L225 Difference]: With dead ends: 155 [2018-11-07 16:48:42,643 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 16:48:42,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:48:42,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 16:48:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-11-07 16:48:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 16:48:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2018-11-07 16:48:42,655 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 32 [2018-11-07 16:48:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:42,655 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2018-11-07 16:48:42,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:48:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-11-07 16:48:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 16:48:42,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:42,657 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:42,657 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:42,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:42,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1098984993, now seen corresponding path program 2 times [2018-11-07 16:48:42,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:42,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:42,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:42,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:42,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:42,749 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:42,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:42,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:42,750 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 16:48:42,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:42,762 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:42,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:42,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:42,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 16:48:42,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 16:48:42,876 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:48:42,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-11-07 16:48:42,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:42,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:48:42,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:48:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:48:42,877 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand 5 states. [2018-11-07 16:48:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:42,956 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2018-11-07 16:48:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:48:42,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-07 16:48:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:42,958 INFO L225 Difference]: With dead ends: 181 [2018-11-07 16:48:42,959 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 16:48:42,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:48:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 16:48:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2018-11-07 16:48:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 16:48:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-11-07 16:48:42,969 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 36 [2018-11-07 16:48:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:42,970 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-11-07 16:48:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:48:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-07 16:48:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 16:48:42,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:42,972 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:42,973 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:42,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2113546820, now seen corresponding path program 1 times [2018-11-07 16:48:42,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:42,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 86 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-07 16:48:43,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:43,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:43,086 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-07 16:48:43,086 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-07 16:48:43,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:43,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:43,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:43,213 INFO L272 AbstractInterpreter]: Visited 26 different actions 101 times. Merged at 10 different actions 49 times. Widened at 2 different actions 4 times. Found 5 fixpoints after 2 different actions. Largest state had 8 variables. [2018-11-07 16:48:43,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:43,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:43,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:43,254 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 16:48:43,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:43,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:43,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 84 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-07 16:48:43,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 86 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-07 16:48:43,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:43,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:48:43,484 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:43,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:48:43,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:48:43,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:48:43,485 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 7 states. [2018-11-07 16:48:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:43,660 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-11-07 16:48:43,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:48:43,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-11-07 16:48:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:43,662 INFO L225 Difference]: With dead ends: 175 [2018-11-07 16:48:43,662 INFO L226 Difference]: Without dead ends: 122 [2018-11-07 16:48:43,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:48:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-07 16:48:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-11-07 16:48:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 16:48:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-11-07 16:48:43,673 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 63 [2018-11-07 16:48:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:43,673 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-11-07 16:48:43,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:48:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-11-07 16:48:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 16:48:43,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:43,676 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:43,676 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:43,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash -631971868, now seen corresponding path program 2 times [2018-11-07 16:48:43,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:43,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:43,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 126 proven. 50 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-07 16:48:43,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:43,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:43,783 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:43,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:43,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:43,784 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:43,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:43,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:43,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:43,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:43,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 20 proven. 127 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 16:48:44,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-07 16:48:44,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:44,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 22 [2018-11-07 16:48:44,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:44,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:48:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:48:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:48:44,796 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 16 states. [2018-11-07 16:48:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:45,562 INFO L93 Difference]: Finished difference Result 270 states and 341 transitions. [2018-11-07 16:48:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:48:45,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-11-07 16:48:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:45,565 INFO L225 Difference]: With dead ends: 270 [2018-11-07 16:48:45,565 INFO L226 Difference]: Without dead ends: 209 [2018-11-07 16:48:45,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:48:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-07 16:48:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2018-11-07 16:48:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 16:48:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2018-11-07 16:48:45,581 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 71 [2018-11-07 16:48:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:45,581 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2018-11-07 16:48:45,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:48:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2018-11-07 16:48:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 16:48:45,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:45,585 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 12, 11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:45,585 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:45,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1550893440, now seen corresponding path program 1 times [2018-11-07 16:48:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:45,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:45,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 174 proven. 72 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 16:48:45,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:45,881 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:45,881 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-07 16:48:45,881 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-07 16:48:45,883 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:45,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:46,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:46,174 INFO L272 AbstractInterpreter]: Visited 28 different actions 173 times. Merged at 12 different actions 69 times. Widened at 3 different actions 6 times. Found 21 fixpoints after 5 different actions. Largest state had 8 variables. [2018-11-07 16:48:46,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:46,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:46,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:46,216 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:46,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:46,232 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:46,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 172 proven. 72 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:48:46,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 174 proven. 72 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 16:48:46,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:46,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:48:46,764 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:46,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:48:46,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:48:46,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:48:46,765 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand 9 states. [2018-11-07 16:48:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:47,058 INFO L93 Difference]: Finished difference Result 365 states and 456 transitions. [2018-11-07 16:48:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:48:47,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-07 16:48:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:47,062 INFO L225 Difference]: With dead ends: 365 [2018-11-07 16:48:47,062 INFO L226 Difference]: Without dead ends: 227 [2018-11-07 16:48:47,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:48:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-07 16:48:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2018-11-07 16:48:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-07 16:48:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2018-11-07 16:48:47,075 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 79 [2018-11-07 16:48:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:47,075 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2018-11-07 16:48:47,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:48:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2018-11-07 16:48:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 16:48:47,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:47,077 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 13, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:47,078 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:47,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -801878872, now seen corresponding path program 2 times [2018-11-07 16:48:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:47,080 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-07 16:48:47,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:47,231 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:47,231 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:47,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:47,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:47,231 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:47,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:47,241 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:47,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:47,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:47,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 28 proven. 231 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-07 16:48:47,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-11-07 16:48:47,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:47,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2018-11-07 16:48:47,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:47,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:48:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:48:47,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:48:47,870 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand 18 states. [2018-11-07 16:48:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:49,165 INFO L93 Difference]: Finished difference Result 409 states and 513 transitions. [2018-11-07 16:48:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:48:49,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-07 16:48:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:49,169 INFO L225 Difference]: With dead ends: 409 [2018-11-07 16:48:49,169 INFO L226 Difference]: Without dead ends: 263 [2018-11-07 16:48:49,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=2045, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 16:48:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-07 16:48:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 247. [2018-11-07 16:48:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-07 16:48:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2018-11-07 16:48:49,184 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 87 [2018-11-07 16:48:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:49,184 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2018-11-07 16:48:49,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:48:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2018-11-07 16:48:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 16:48:49,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:49,186 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 16, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:49,186 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:49,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:49,187 INFO L82 PathProgramCache]: Analyzing trace with hash 220500928, now seen corresponding path program 3 times [2018-11-07 16:48:49,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:49,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:49,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:49,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:49,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 294 proven. 128 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-07 16:48:49,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:49,370 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:49,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:49,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:49,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:49,370 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:49,379 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:49,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:49,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:49,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 110 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:49,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 56 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:49,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:49,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19] total 36 [2018-11-07 16:48:49,817 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:48:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:48:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:48:49,819 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand 28 states. [2018-11-07 16:48:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:50,815 INFO L93 Difference]: Finished difference Result 572 states and 717 transitions. [2018-11-07 16:48:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:48:50,816 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 95 [2018-11-07 16:48:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:50,818 INFO L225 Difference]: With dead ends: 572 [2018-11-07 16:48:50,818 INFO L226 Difference]: Without dead ends: 402 [2018-11-07 16:48:50,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 16:48:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-07 16:48:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 373. [2018-11-07 16:48:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-07 16:48:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 445 transitions. [2018-11-07 16:48:50,846 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 445 transitions. Word has length 95 [2018-11-07 16:48:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:50,846 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 445 transitions. [2018-11-07 16:48:50,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:48:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 445 transitions. [2018-11-07 16:48:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 16:48:50,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:50,848 INFO L375 BasicCegarLoop]: trace histogram [20, 18, 18, 17, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:50,849 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:50,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash -911767712, now seen corresponding path program 4 times [2018-11-07 16:48:50,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:50,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:50,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:50,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:50,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 366 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 16:48:51,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:51,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:51,084 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:51,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:51,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:51,084 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:51,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:51,093 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:51,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 364 proven. 162 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-11-07 16:48:51,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 366 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 16:48:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:51,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:48:51,428 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:51,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:48:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:48:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:48:51,429 INFO L87 Difference]: Start difference. First operand 373 states and 445 transitions. Second operand 12 states. [2018-11-07 16:48:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:51,716 INFO L93 Difference]: Finished difference Result 729 states and 879 transitions. [2018-11-07 16:48:51,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:48:51,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-11-07 16:48:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:51,719 INFO L225 Difference]: With dead ends: 729 [2018-11-07 16:48:51,719 INFO L226 Difference]: Without dead ends: 448 [2018-11-07 16:48:51,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:48:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-07 16:48:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 409. [2018-11-07 16:48:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-07 16:48:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 490 transitions. [2018-11-07 16:48:51,743 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 490 transitions. Word has length 103 [2018-11-07 16:48:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:51,744 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 490 transitions. [2018-11-07 16:48:51,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:48:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 490 transitions. [2018-11-07 16:48:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 16:48:51,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:51,746 INFO L375 BasicCegarLoop]: trace histogram [22, 20, 20, 19, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:51,746 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:51,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1728217600, now seen corresponding path program 5 times [2018-11-07 16:48:51,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:51,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:51,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 446 proven. 200 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-11-07 16:48:51,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:51,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:51,935 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:51,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:51,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:51,936 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:51,963 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:51,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:51,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:51,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 40 proven. 447 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-11-07 16:48:52,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2018-11-07 16:48:52,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2018-11-07 16:48:52,297 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:52,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:48:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:48:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:48:52,299 INFO L87 Difference]: Start difference. First operand 409 states and 490 transitions. Second operand 21 states. [2018-11-07 16:48:53,143 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-07 16:48:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:54,238 INFO L93 Difference]: Finished difference Result 968 states and 1173 transitions. [2018-11-07 16:48:54,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:48:54,239 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2018-11-07 16:48:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:54,242 INFO L225 Difference]: With dead ends: 968 [2018-11-07 16:48:54,243 INFO L226 Difference]: Without dead ends: 663 [2018-11-07 16:48:54,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=553, Invalid=1897, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:48:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-07 16:48:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 598. [2018-11-07 16:48:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-07 16:48:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 720 transitions. [2018-11-07 16:48:54,272 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 720 transitions. Word has length 111 [2018-11-07 16:48:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:54,272 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 720 transitions. [2018-11-07 16:48:54,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:48:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 720 transitions. [2018-11-07 16:48:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 16:48:54,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:54,274 INFO L375 BasicCegarLoop]: trace histogram [25, 23, 23, 21, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:54,274 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:54,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1425162325, now seen corresponding path program 1 times [2018-11-07 16:48:54,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:54,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:54,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 580 proven. 242 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-07 16:48:55,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:55,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:55,005 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-11-07 16:48:55,005 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-07 16:48:55,006 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:55,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:55,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:55,085 INFO L272 AbstractInterpreter]: Visited 27 different actions 111 times. Merged at 11 different actions 50 times. Widened at 2 different actions 4 times. Found 14 fixpoints after 4 different actions. Largest state had 8 variables. [2018-11-07 16:48:55,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:55,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:55,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:55,127 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:55,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:55,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:55,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 578 proven. 242 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-07 16:48:55,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 580 proven. 242 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-07 16:48:55,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:55,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 16:48:55,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:55,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:48:55,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:48:55,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:48:55,855 INFO L87 Difference]: Start difference. First operand 598 states and 720 transitions. Second operand 14 states. [2018-11-07 16:48:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:56,083 INFO L93 Difference]: Finished difference Result 1165 states and 1412 transitions. [2018-11-07 16:48:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:48:56,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2018-11-07 16:48:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:56,087 INFO L225 Difference]: With dead ends: 1165 [2018-11-07 16:48:56,087 INFO L226 Difference]: Without dead ends: 683 [2018-11-07 16:48:56,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:48:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-07 16:48:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 634. [2018-11-07 16:48:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-07 16:48:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 765 transitions. [2018-11-07 16:48:56,122 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 765 transitions. Word has length 123 [2018-11-07 16:48:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:56,122 INFO L480 AbstractCegarLoop]: Abstraction has 634 states and 765 transitions. [2018-11-07 16:48:56,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:48:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 765 transitions. [2018-11-07 16:48:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 16:48:56,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:56,124 INFO L375 BasicCegarLoop]: trace histogram [26, 24, 24, 22, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:56,125 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:56,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1006237892, now seen corresponding path program 2 times [2018-11-07 16:48:56,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:56,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:56,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 630 proven. 288 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-07 16:48:56,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:56,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:56,351 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:56,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:56,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:56,351 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:56,361 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:56,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:48:56,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:56,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 48 proven. 631 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-11-07 16:48:56,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-11-07 16:48:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:56,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 30 [2018-11-07 16:48:56,715 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:56,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:48:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:48:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:48:56,716 INFO L87 Difference]: Start difference. First operand 634 states and 765 transitions. Second operand 23 states. [2018-11-07 16:48:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:58,827 INFO L93 Difference]: Finished difference Result 1265 states and 1538 transitions. [2018-11-07 16:48:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 16:48:58,827 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-11-07 16:48:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:58,830 INFO L225 Difference]: With dead ends: 1265 [2018-11-07 16:48:58,830 INFO L226 Difference]: Without dead ends: 759 [2018-11-07 16:48:58,834 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1040, Invalid=3930, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 16:48:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-07 16:48:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 623. [2018-11-07 16:48:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-11-07 16:48:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 749 transitions. [2018-11-07 16:48:58,870 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 749 transitions. Word has length 127 [2018-11-07 16:48:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:58,870 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 749 transitions. [2018-11-07 16:48:58,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:48:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 749 transitions. [2018-11-07 16:48:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 16:48:58,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:58,874 INFO L375 BasicCegarLoop]: trace histogram [42, 39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:58,874 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:58,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:58,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1712707552, now seen corresponding path program 3 times [2018-11-07 16:48:58,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:58,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:58,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1468 proven. 338 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-11-07 16:48:59,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:59,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:59,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:59,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:59,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:59,163 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:59,188 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:59,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:59,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:59,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1464 proven. 338 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-11-07 16:48:59,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1468 proven. 338 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-11-07 16:48:59,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:59,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:48:59,750 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:59,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:48:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:48:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:48:59,752 INFO L87 Difference]: Start difference. First operand 623 states and 749 transitions. Second operand 16 states. [2018-11-07 16:48:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:59,909 INFO L93 Difference]: Finished difference Result 1235 states and 1493 transitions. [2018-11-07 16:48:59,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:48:59,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 198 [2018-11-07 16:48:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:59,916 INFO L225 Difference]: With dead ends: 1235 [2018-11-07 16:48:59,916 INFO L226 Difference]: Without dead ends: 752 [2018-11-07 16:48:59,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:48:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-07 16:48:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 549. [2018-11-07 16:48:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-11-07 16:48:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 664 transitions. [2018-11-07 16:48:59,957 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 664 transitions. Word has length 198 [2018-11-07 16:48:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:59,957 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 664 transitions. [2018-11-07 16:48:59,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:48:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 664 transitions. [2018-11-07 16:48:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-07 16:48:59,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:59,962 INFO L375 BasicCegarLoop]: trace histogram [45, 42, 42, 42, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:59,962 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:59,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1061715719, now seen corresponding path program 4 times [2018-11-07 16:48:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:59,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:59,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:59,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:59,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1692 proven. 392 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2018-11-07 16:49:01,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:01,073 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:01,073 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:01,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:01,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:01,073 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:01,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:01,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:01,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1688 proven. 392 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2018-11-07 16:49:01,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1692 proven. 392 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2018-11-07 16:49:01,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:01,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 16:49:01,802 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:01,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:49:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:49:01,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:49:01,803 INFO L87 Difference]: Start difference. First operand 549 states and 664 transitions. Second operand 17 states. [2018-11-07 16:49:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:01,948 INFO L93 Difference]: Finished difference Result 1021 states and 1242 transitions. [2018-11-07 16:49:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:49:01,950 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 210 [2018-11-07 16:49:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:01,953 INFO L225 Difference]: With dead ends: 1021 [2018-11-07 16:49:01,953 INFO L226 Difference]: Without dead ends: 624 [2018-11-07 16:49:01,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:49:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-07 16:49:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 585. [2018-11-07 16:49:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-07 16:49:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 709 transitions. [2018-11-07 16:49:01,986 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 709 transitions. Word has length 210 [2018-11-07 16:49:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:01,986 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 709 transitions. [2018-11-07 16:49:01,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:49:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 709 transitions. [2018-11-07 16:49:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-07 16:49:01,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:01,989 INFO L375 BasicCegarLoop]: trace histogram [48, 45, 45, 45, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:01,989 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:01,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:01,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1595542674, now seen corresponding path program 5 times [2018-11-07 16:49:01,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:01,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:01,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1932 proven. 450 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2018-11-07 16:49:02,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:02,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:02,255 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:02,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:02,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:02,256 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:02,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:02,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:49:02,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:02,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1998 proven. 1 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [2018-11-07 16:49:02,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1940 proven. 59 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [2018-11-07 16:49:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 9] total 30 [2018-11-07 16:49:02,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:02,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:49:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:49:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:49:02,779 INFO L87 Difference]: Start difference. First operand 585 states and 709 transitions. Second operand 26 states. [2018-11-07 16:49:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:03,622 INFO L93 Difference]: Finished difference Result 1103 states and 1349 transitions. [2018-11-07 16:49:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:49:03,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 222 [2018-11-07 16:49:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:03,625 INFO L225 Difference]: With dead ends: 1103 [2018-11-07 16:49:03,625 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:49:03,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=600, Invalid=1562, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:49:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:49:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:49:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:49:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:49:03,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222 [2018-11-07 16:49:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:03,629 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:49:03,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:49:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:49:03,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:49:03,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:49:04,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,151 WARN L179 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 88 [2018-11-07 16:49:04,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:04,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:49:05,317 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 87 DAG size of output: 18 [2018-11-07 16:49:05,372 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:49:05,373 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:49:05,373 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:49:05,373 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-11-07 16:49:05,373 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-11-07 16:49:05,373 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-11-07 16:49:05,373 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:49:05,373 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~last~0 199999) [2018-11-07 16:49:05,374 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:49:05,374 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:49:05,374 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (< 199999 |old(~last~0)|) (and (= main_~b~0 0) (= main_~c~0 0) (<= 0 (+ ~last~0 2147483648)) (= main_~a~0 0) (<= ~last~0 2147483647))) [2018-11-07 16:49:05,374 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (< 199999 |old(~last~0)|)) [2018-11-07 16:49:05,374 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-07 16:49:05,374 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-11-07 16:49:05,374 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (or (< 199999 |old(~last~0)|) (<= ~last~0 199999)) [2018-11-07 16:49:05,374 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse0 (= main_~b~0 main_~a~0)) (.cse1 (<= main_~c~0 200000))) (or (and .cse0 .cse1 (<= 1 main_~st~0)) (< 199999 |old(~last~0)|) (and .cse0 .cse1 (<= ~last~0 199999)))) [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-07 16:49:05,375 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-11-07 16:49:05,376 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-11-07 16:49:05,376 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-11-07 16:49:05,376 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-07 16:49:05,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:49:05 BoogieIcfgContainer [2018-11-07 16:49:05,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:49:05,387 INFO L168 Benchmark]: Toolchain (without parser) took 29040.99 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -994.1 MB). Peak memory consumption was 136.8 MB. Max. memory is 7.1 GB. [2018-11-07 16:49:05,388 INFO L168 Benchmark]: CDTParser took 0.21 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 16:49:05,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.22 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 16:49:05,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.20 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 16:49:05,389 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 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 16:49:05,389 INFO L168 Benchmark]: RCFGBuilder took 488.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:49:05,390 INFO L168 Benchmark]: TraceAbstraction took 28169.97 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 382.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -203.9 MB). Peak memory consumption was 178.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:49:05,394 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.21 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 335.22 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 20.20 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 22.82 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 488.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28169.97 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 382.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -203.9 MB). Peak memory consumption was 178.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 26]: Loop Invariant Derived loop invariant: (((b == a && c <= 200000) && 1 <= st) || 199999 < \old(last)) || ((b == a && c <= 200000) && last <= 199999) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((b == a && 200000 <= c) && c <= 200000) || 199999 < \old(last)) || ((((b == 0 && c == 0) && 0 <= last + 2147483648) && a == 0) && last <= 2147483647) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 28.0s OverallTime, 23 OverallIterations, 48 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 639 SDtfs, 1134 SDslu, 3722 SDs, 0 SdLazy, 3364 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3685 GetRequests, 3198 SyntacticMatches, 9 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.8043478260869565 AbsIntWeakeningRatio, 0.6086956521739131 AbsIntAvgWeakeningVarsNumRemoved, 0.782608695652174 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 692 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 93 PreInvPairs, 264 NumberOfFragments, 88 HoareAnnotationTreeSize, 93 FomulaSimplifications, 59709 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 424 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 3461 NumberOfCodeBlocks, 2973 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5071 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400661 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2250 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 59 InterpolantComputations, 8 PerfectInterpolantSequences, 42768/50566 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...