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.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:03:48,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:03:48,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:03:48,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:03:48,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:03:48,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:03:48,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:03:48,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:03:48,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:03:48,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:03:48,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:03:48,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:03:48,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:03:48,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:03:48,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:03:48,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:03:48,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:03:48,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:03:48,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:03:48,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:03:48,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:03:48,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:03:48,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:03:48,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:03:48,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:03:48,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:03:48,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:03:48,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:03:48,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:03:48,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:03:48,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:03:48,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:03:48,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:03:48,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:03:48,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:03:48,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:03:48,726 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:03:48,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:03:48,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:03:48,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:03:48,757 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:03:48,757 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:03:48,758 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:03:48,758 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:03:48,758 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:03:48,758 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:03:48,758 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:03:48,761 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:03:48,761 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:03:48,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:03:48,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:03:48,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:03:48,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:03:48,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:03:48,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:03:48,763 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:03:48,763 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:03:48,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:03:48,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:03:48,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:03:48,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:03:48,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:03:48,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:03:48,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:03:48,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:03:48,767 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:03:48,767 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:03:48,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:03:48,767 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:03:48,767 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:03:48,767 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:03:48,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:03:48,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:03:48,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:03:48,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:03:48,840 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:03:48,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-07 05:03:48,901 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29e31eb7/b737ba53c76d4d909fdb93c0dd57088e/FLAGe45a51ad8 [2018-11-07 05:03:49,340 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:03:49,340 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-07 05:03:49,347 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29e31eb7/b737ba53c76d4d909fdb93c0dd57088e/FLAGe45a51ad8 [2018-11-07 05:03:49,368 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29e31eb7/b737ba53c76d4d909fdb93c0dd57088e [2018-11-07 05:03:49,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:03:49,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:03:49,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:03:49,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:03:49,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:03:49,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae48c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49, skipping insertion in model container [2018-11-07 05:03:49,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:03:49,432 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:03:49,692 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:03:49,696 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:03:49,717 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:03:49,739 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:03:49,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49 WrapperNode [2018-11-07 05:03:49,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:03:49,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:03:49,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:03:49,740 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:03:49,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:03:49,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:03:49,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:03:49,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:03:49,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (1/1) ... [2018-11-07 05:03:49,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:03:49,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:03:49,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:03:49,792 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:03:49,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (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 05:03:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 05:03:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:03:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:03:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 05:03:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:03:49,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:03:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:03:49,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:03:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 05:03:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:03:49,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:03:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 05:03:50,301 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:03:50,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:03:50 BoogieIcfgContainer [2018-11-07 05:03:50,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:03:50,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:03:50,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:03:50,307 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:03:50,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:03:49" (1/3) ... [2018-11-07 05:03:50,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5806b0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:03:50, skipping insertion in model container [2018-11-07 05:03:50,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:49" (2/3) ... [2018-11-07 05:03:50,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5806b0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:03:50, skipping insertion in model container [2018-11-07 05:03:50,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:03:50" (3/3) ... [2018-11-07 05:03:50,311 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-07 05:03:50,321 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:03:50,331 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:03:50,349 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:03:50,380 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:03:50,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:03:50,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:03:50,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:03:50,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:03:50,382 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:03:50,382 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:03:50,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:03:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 05:03:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:03:50,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:50,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:50,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:50,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash -794956242, now seen corresponding path program 1 times [2018-11-07 05:03:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:50,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:50,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:50,554 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 05:03:50,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:50,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:03:50,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:50,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:03:50,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:03:50,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:03:50,577 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 05:03:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:50,603 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-07 05:03:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:03:50,605 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 05:03:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:50,613 INFO L225 Difference]: With dead ends: 57 [2018-11-07 05:03:50,613 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 05:03:50,616 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 05:03:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 05:03:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 05:03:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 05:03:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-07 05:03:50,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2018-11-07 05:03:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:50,666 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-07 05:03:50,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:03:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-07 05:03:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:03:50,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:50,668 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 05:03:50,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:50,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash -184952832, now seen corresponding path program 1 times [2018-11-07 05:03:50,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:50,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:51,001 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 05:03:51,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:51,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:03:51,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:51,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:03:51,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:03:51,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:03:51,005 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2018-11-07 05:03:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:51,115 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-07 05:03:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:03:51,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 05:03:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:51,117 INFO L225 Difference]: With dead ends: 36 [2018-11-07 05:03:51,117 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 05:03:51,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:03:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 05:03:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 05:03:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 05:03:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 05:03:51,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2018-11-07 05:03:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:51,127 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 05:03:51,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:03:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 05:03:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:03:51,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:51,129 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, 1] [2018-11-07 05:03:51,129 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash -683349085, now seen corresponding path program 1 times [2018-11-07 05:03:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:51,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:51,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:51,204 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 05:03:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:03:51,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:51,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:03:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:03:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:03:51,206 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-11-07 05:03:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:51,338 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-11-07 05:03:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:03:51,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-07 05:03:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:51,343 INFO L225 Difference]: With dead ends: 70 [2018-11-07 05:03:51,343 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 05:03:51,344 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 05:03:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 05:03:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-11-07 05:03:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 05:03:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-07 05:03:51,364 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 21 [2018-11-07 05:03:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:51,365 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-07 05:03:51,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:03:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-07 05:03:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 05:03:51,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:51,369 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, 1] [2018-11-07 05:03:51,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:51,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:51,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1268837578, now seen corresponding path program 1 times [2018-11-07 05:03:51,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:51,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:51,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:51,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:51,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:51,477 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 05:03:51,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:51,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:51,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-07 05:03:51,481 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [14], [16], [17], [18], [22], [26], [31], [32], [33], [38], [39], [40], [52], [55], [57], [63], [64], [65], [67] [2018-11-07 05:03:51,539 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:03:51,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:03:51,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:03:52,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:03:52,344 INFO L272 AbstractInterpreter]: Visited 24 different actions 187 times. Merged at 13 different actions 125 times. Widened at 2 different actions 12 times. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-07 05:03:52,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:52,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:03:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:52,387 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 05:03:52,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:52,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:52,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:52,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-07 05:03:52,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-07 05:03:52,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:52,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:52,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:52,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-07 05:03:52,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-07 05:03:52,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:03:52,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-07 05:03:52,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:52,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:52,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:52,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-11-07 05:03:52,770 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 05:03:52,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:52,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-07 05:03:53,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-07 05:03:53,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:53,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 05:03:53,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 05:03:53,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-11-07 05:03:53,115 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 05:03:53,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 13 [2018-11-07 05:03:53,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:53,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:03:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:03:53,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:03:53,147 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 9 states. [2018-11-07 05:03:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:54,051 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-11-07 05:03:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:03:54,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-07 05:03:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:54,054 INFO L225 Difference]: With dead ends: 124 [2018-11-07 05:03:54,054 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 05:03:54,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:03:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 05:03:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 49. [2018-11-07 05:03:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 05:03:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-07 05:03:54,068 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 25 [2018-11-07 05:03:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:54,068 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-07 05:03:54,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:03:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-07 05:03:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 05:03:54,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:54,070 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:54,070 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:54,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1970400408, now seen corresponding path program 2 times [2018-11-07 05:03:54,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:54,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:54,200 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 05:03:54,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:54,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:54,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:54,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:54,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:54,201 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 05:03:54,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:03:54,215 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:03:55,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 05:03:55,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:55,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:55,154 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 05:03:55,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:55,230 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 05:03:55,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:55,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 05:03:55,260 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:55,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:03:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:03:55,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:03:55,261 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-11-07 05:03:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:55,750 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-11-07 05:03:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:03:55,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-07 05:03:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:55,752 INFO L225 Difference]: With dead ends: 121 [2018-11-07 05:03:55,752 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 05:03:55,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:03:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 05:03:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2018-11-07 05:03:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 05:03:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-07 05:03:55,763 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-11-07 05:03:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:55,764 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-07 05:03:55,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:03:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-07 05:03:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 05:03:55,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:55,765 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:55,766 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash 415918911, now seen corresponding path program 3 times [2018-11-07 05:03:55,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:55,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:55,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:56,048 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 05:03:56,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:56,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:56,049 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:56,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:56,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:56,050 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 05:03:56,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:03:56,060 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:03:56,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:03:56,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:56,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:56,103 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 05:03:56,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:56,244 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 05:03:56,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:56,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 05:03:56,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:56,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:03:56,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:03:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:03:56,265 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 7 states. [2018-11-07 05:03:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:56,515 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2018-11-07 05:03:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:03:56,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-07 05:03:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:56,519 INFO L225 Difference]: With dead ends: 130 [2018-11-07 05:03:56,520 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 05:03:56,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:03:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 05:03:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 51. [2018-11-07 05:03:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 05:03:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-07 05:03:56,532 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 37 [2018-11-07 05:03:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:56,532 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-07 05:03:56,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:03:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-07 05:03:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:03:56,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:56,534 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:56,534 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:56,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1222983270, now seen corresponding path program 4 times [2018-11-07 05:03:56,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:56,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:56,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:56,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:56,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:56,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:56,689 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:56,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:56,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:56,689 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 05:03:56,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:56,701 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:56,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:56,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 05:03:56,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:03:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:03:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:03:56,907 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 8 states. [2018-11-07 05:03:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:57,351 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2018-11-07 05:03:57,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:03:57,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 05:03:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:57,353 INFO L225 Difference]: With dead ends: 145 [2018-11-07 05:03:57,353 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 05:03:57,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:03:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 05:03:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 55. [2018-11-07 05:03:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 05:03:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-07 05:03:57,365 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 41 [2018-11-07 05:03:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:57,365 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-07 05:03:57,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:03:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-07 05:03:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 05:03:57,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:57,367 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:57,368 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:57,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2072258061, now seen corresponding path program 5 times [2018-11-07 05:03:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:57,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:57,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:57,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:57,584 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:57,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:57,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:57,584 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 05:03:57,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:03:57,598 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:00,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 05:04:00,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:00,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:00,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:01,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:01,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 05:04:01,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:01,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:04:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:04:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:04:01,087 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 9 states. [2018-11-07 05:04:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:01,621 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2018-11-07 05:04:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:04:01,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-07 05:04:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:01,625 INFO L225 Difference]: With dead ends: 160 [2018-11-07 05:04:01,625 INFO L226 Difference]: Without dead ends: 138 [2018-11-07 05:04:01,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:04:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-07 05:04:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 59. [2018-11-07 05:04:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 05:04:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-07 05:04:01,637 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 45 [2018-11-07 05:04:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:01,638 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-07 05:04:01,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:04:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-07 05:04:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 05:04:01,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:01,639 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:01,640 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:01,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash -276241868, now seen corresponding path program 6 times [2018-11-07 05:04:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:01,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:01,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:01,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:01,808 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:01,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:01,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:01,808 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 05:04:01,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:01,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:01,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:01,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:01,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:01,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 05:04:02,187 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:02,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:04:02,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:04:02,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:04:02,188 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 10 states. [2018-11-07 05:04:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:03,171 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2018-11-07 05:04:03,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:04:03,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-11-07 05:04:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:03,173 INFO L225 Difference]: With dead ends: 175 [2018-11-07 05:04:03,174 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 05:04:03,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:04:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 05:04:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 63. [2018-11-07 05:04:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 05:04:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-07 05:04:03,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 49 [2018-11-07 05:04:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:03,188 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-07 05:04:03,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:04:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-07 05:04:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 05:04:03,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:03,190 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:03,190 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:03,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash 485831387, now seen corresponding path program 7 times [2018-11-07 05:04:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:03,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:03,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:03,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:03,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:03,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:03,475 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:03,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 05:04:03,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:03,475 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 05:04:03,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:03,485 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:03,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:03,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:04,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:04,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 05:04:04,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:04,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:04:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:04:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:04:04,002 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 11 states. [2018-11-07 05:04:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:05,066 INFO L93 Difference]: Finished difference Result 190 states and 221 transitions. [2018-11-07 05:04:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:04:05,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-07 05:04:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:05,068 INFO L225 Difference]: With dead ends: 190 [2018-11-07 05:04:05,068 INFO L226 Difference]: Without dead ends: 168 [2018-11-07 05:04:05,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:04:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-07 05:04:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 67. [2018-11-07 05:04:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 05:04:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-07 05:04:05,081 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 53 [2018-11-07 05:04:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:05,081 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-07 05:04:05,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:04:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-07 05:04:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 05:04:05,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:05,083 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:05,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:05,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash 619370498, now seen corresponding path program 8 times [2018-11-07 05:04:05,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:05,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:05,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:05,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:05,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:05,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:05,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:05,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:05,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:05,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:05,354 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 05:04:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:05,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:07,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 05:04:07,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:07,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:07,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:07,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:07,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 05:04:07,978 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:07,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:04:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:04:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:04:07,982 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 12 states. [2018-11-07 05:04:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:08,952 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2018-11-07 05:04:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:04:08,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-07 05:04:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:08,954 INFO L225 Difference]: With dead ends: 205 [2018-11-07 05:04:08,954 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 05:04:08,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:04:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 05:04:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 71. [2018-11-07 05:04:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 05:04:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-07 05:04:08,965 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 57 [2018-11-07 05:04:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:08,965 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-07 05:04:08,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:04:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-07 05:04:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 05:04:08,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:08,967 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:08,967 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:08,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1101762985, now seen corresponding path program 9 times [2018-11-07 05:04:08,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:08,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:08,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:09,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:09,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:09,359 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:09,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:09,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:09,360 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 05:04:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:09,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:09,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:09,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:09,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:09,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:09,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:09,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 05:04:09,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:09,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:04:09,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:04:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:04:09,872 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 13 states. [2018-11-07 05:04:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:10,971 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2018-11-07 05:04:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:04:10,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-07 05:04:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:10,974 INFO L225 Difference]: With dead ends: 220 [2018-11-07 05:04:10,974 INFO L226 Difference]: Without dead ends: 198 [2018-11-07 05:04:10,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:04:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-07 05:04:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 75. [2018-11-07 05:04:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 05:04:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-07 05:04:10,985 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 61 [2018-11-07 05:04:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:10,986 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-07 05:04:10,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:04:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-07 05:04:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 05:04:10,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:10,987 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:10,987 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:10,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 916004816, now seen corresponding path program 10 times [2018-11-07 05:04:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:10,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:10,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:11,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:11,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:11,230 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:11,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:11,230 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 05:04:11,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:11,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:11,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:11,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:11,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:11,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 05:04:11,718 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:04:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:04:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:04:11,720 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 14 states. [2018-11-07 05:04:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:12,846 INFO L93 Difference]: Finished difference Result 235 states and 275 transitions. [2018-11-07 05:04:12,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:04:12,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-07 05:04:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:12,848 INFO L225 Difference]: With dead ends: 235 [2018-11-07 05:04:12,849 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 05:04:12,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:04:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 05:04:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 79. [2018-11-07 05:04:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 05:04:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-07 05:04:12,859 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 65 [2018-11-07 05:04:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:12,859 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-07 05:04:12,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:04:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-07 05:04:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 05:04:12,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:12,861 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:12,861 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:12,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1070251401, now seen corresponding path program 11 times [2018-11-07 05:04:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:13,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:13,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:13,162 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:13,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:13,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:13,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 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 05:04:13,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:13,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:07,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 05:05:07,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:07,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:07,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:08,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 05:05:08,147 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:08,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 05:05:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 05:05:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:05:08,149 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 15 states. [2018-11-07 05:05:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:09,629 INFO L93 Difference]: Finished difference Result 250 states and 293 transitions. [2018-11-07 05:05:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:05:09,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2018-11-07 05:05:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:09,632 INFO L225 Difference]: With dead ends: 250 [2018-11-07 05:05:09,632 INFO L226 Difference]: Without dead ends: 228 [2018-11-07 05:05:09,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:05:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-07 05:05:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 83. [2018-11-07 05:05:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 05:05:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-07 05:05:09,643 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 69 [2018-11-07 05:05:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:09,644 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-07 05:05:09,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 05:05:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-07 05:05:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-07 05:05:09,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:09,645 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:09,645 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:09,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 69319070, now seen corresponding path program 12 times [2018-11-07 05:05:09,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:09,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:09,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:09,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:09,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:09,887 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:09,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:09,887 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 05:05:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:09,900 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:09,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:09,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:09,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:09,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:10,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:10,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 05:05:10,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:10,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:05:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:05:10,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:05:10,444 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 16 states. [2018-11-07 05:05:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:11,893 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2018-11-07 05:05:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:05:11,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-11-07 05:05:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:11,895 INFO L225 Difference]: With dead ends: 265 [2018-11-07 05:05:11,895 INFO L226 Difference]: Without dead ends: 243 [2018-11-07 05:05:11,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:05:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-07 05:05:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 87. [2018-11-07 05:05:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 05:05:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-07 05:05:11,906 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 73 [2018-11-07 05:05:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:11,906 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-07 05:05:11,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:05:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-07 05:05:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 05:05:11,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:11,907 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:11,908 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:11,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 18892101, now seen corresponding path program 13 times [2018-11-07 05:05:11,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:11,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:11,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:12,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:12,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:12,674 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:12,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:12,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:12,674 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 05:05:12,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:12,688 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:12,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:12,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:13,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:13,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 05:05:13,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:13,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:05:13,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:05:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:05:13,268 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 17 states. [2018-11-07 05:05:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:15,009 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2018-11-07 05:05:15,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:05:15,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-11-07 05:05:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:15,012 INFO L225 Difference]: With dead ends: 280 [2018-11-07 05:05:15,012 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 05:05:15,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:05:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 05:05:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 91. [2018-11-07 05:05:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 05:05:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-07 05:05:15,027 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 77 [2018-11-07 05:05:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:15,027 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-07 05:05:15,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:05:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-07 05:05:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 05:05:15,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:15,028 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:15,029 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:15,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash -15555220, now seen corresponding path program 14 times [2018-11-07 05:05:15,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:15,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:15,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:15,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:15,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:15,632 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:15,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:15,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:15,633 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 05:05:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:15,643 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:07:40,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 05:07:40,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:40,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:40,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:41,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:07:41,427 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:41,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:07:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:07:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:07:41,428 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 18 states. [2018-11-07 05:07:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:43,077 INFO L93 Difference]: Finished difference Result 295 states and 347 transitions. [2018-11-07 05:07:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:07:43,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-11-07 05:07:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:43,079 INFO L225 Difference]: With dead ends: 295 [2018-11-07 05:07:43,079 INFO L226 Difference]: Without dead ends: 273 [2018-11-07 05:07:43,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:07:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-07 05:07:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 95. [2018-11-07 05:07:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 05:07:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-07 05:07:43,090 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 81 [2018-11-07 05:07:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:43,091 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-07 05:07:43,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:07:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-07 05:07:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 05:07:43,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:43,092 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:43,092 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:43,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -17130989, now seen corresponding path program 15 times [2018-11-07 05:07:43,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:43,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:43,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:44,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:44,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:44,625 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:44,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:44,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:44,625 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 05:07:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:07:44,633 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:07:44,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:07:44,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:44,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:44,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:45,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:45,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:07:45,378 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:45,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:07:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:07:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:07:45,380 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 19 states. [2018-11-07 05:07:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:47,764 INFO L93 Difference]: Finished difference Result 310 states and 365 transitions. [2018-11-07 05:07:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:07:47,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-11-07 05:07:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:47,766 INFO L225 Difference]: With dead ends: 310 [2018-11-07 05:07:47,767 INFO L226 Difference]: Without dead ends: 288 [2018-11-07 05:07:47,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:07:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-07 05:07:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 99. [2018-11-07 05:07:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 05:07:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-07 05:07:47,779 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 85 [2018-11-07 05:07:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:47,779 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-07 05:07:47,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:07:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-07 05:07:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 05:07:47,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:47,781 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:47,781 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash 721019706, now seen corresponding path program 16 times [2018-11-07 05:07:47,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:47,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:47,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:48,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:48,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:48,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:48,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:48,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:48,168 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 05:07:48,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:48,177 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:07:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:48,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:48,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:48,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 05:07:48,975 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:48,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 05:07:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 05:07:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 05:07:48,977 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 20 states. [2018-11-07 05:07:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:51,251 INFO L93 Difference]: Finished difference Result 325 states and 383 transitions. [2018-11-07 05:07:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 05:07:51,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-07 05:07:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:51,253 INFO L225 Difference]: With dead ends: 325 [2018-11-07 05:07:51,253 INFO L226 Difference]: Without dead ends: 303 [2018-11-07 05:07:51,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 05:07:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-07 05:07:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 103. [2018-11-07 05:07:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-07 05:07:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-11-07 05:07:51,266 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 89 [2018-11-07 05:07:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:51,266 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-07 05:07:51,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 05:07:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-07 05:07:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 05:07:51,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:51,268 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:51,268 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1179795681, now seen corresponding path program 17 times [2018-11-07 05:07:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:51,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:51,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:51,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:51,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:51,605 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:51,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:51,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:51,605 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 05:07:51,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:07:51,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown