java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:37:19,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:37:19,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:37:19,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:37:19,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:37:19,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:37:19,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:37:19,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:37:19,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:37:19,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:37:19,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:37:19,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:37:19,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:37:19,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:37:19,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:37:19,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:37:19,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:37:19,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:37:19,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:37:19,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:37:19,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:37:19,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:37:19,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:37:19,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:37:19,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:37:19,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:37:19,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:37:19,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:37:19,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:37:19,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:37:19,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:37:19,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:37:19,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:37:19,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:37:19,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:37:19,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:37:19,709 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:37:19,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:37:19,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:37:19,734 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:37:19,734 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:37:19,734 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:37:19,735 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:37:19,735 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:37:19,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:37:19,735 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:37:19,735 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:37:19,735 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:37:19,736 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:37:19,736 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:37:19,736 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:37:19,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:37:19,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:37:19,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:37:19,737 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:37:19,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:37:19,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:37:19,738 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:37:19,738 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:37:19,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:37:19,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:37:19,739 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:37:19,739 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:37:19,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:19,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:37:19,740 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:37:19,740 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:37:19,740 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:37:19,740 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:37:19,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:37:19,741 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:37:19,741 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:37:19,741 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:37:19,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:37:19,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:37:19,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:37:19,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:37:19,833 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:37:19,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 10:37:19,895 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f5fbdb2/88c62afbcce548a6b0390f26325298d5/FLAGc9741faea [2018-11-07 10:37:20,361 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:37:20,362 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 10:37:20,372 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f5fbdb2/88c62afbcce548a6b0390f26325298d5/FLAGc9741faea [2018-11-07 10:37:20,389 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f5fbdb2/88c62afbcce548a6b0390f26325298d5 [2018-11-07 10:37:20,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:37:20,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:37:20,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:20,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:37:20,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:37:20,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1cd4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20, skipping insertion in model container [2018-11-07 10:37:20,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:37:20,443 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:37:20,668 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:20,674 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:37:20,695 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:20,715 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:37:20,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20 WrapperNode [2018-11-07 10:37:20,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:20,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:20,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:37:20,717 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:37:20,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:20,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:37:20,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:37:20,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:37:20,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... [2018-11-07 10:37:20,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:37:20,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:37:20,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:37:20,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:37:20,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:37:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:37:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:37:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:37:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:37:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:37:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:37:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:37:21,445 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:37:21,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:21 BoogieIcfgContainer [2018-11-07 10:37:21,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:37:21,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:37:21,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:37:21,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:37:21,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:37:20" (1/3) ... [2018-11-07 10:37:21,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abff579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:21, skipping insertion in model container [2018-11-07 10:37:21,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:20" (2/3) ... [2018-11-07 10:37:21,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abff579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:21, skipping insertion in model container [2018-11-07 10:37:21,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:21" (3/3) ... [2018-11-07 10:37:21,457 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 10:37:21,466 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:37:21,473 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:37:21,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:37:21,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:37:21,523 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:37:21,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:37:21,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:37:21,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:37:21,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:37:21,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:37:21,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:37:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-07 10:37:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:37:21,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:21,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:21,556 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:21,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -745796184, now seen corresponding path program 1 times [2018-11-07 10:37:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:21,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:21,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:37:21,670 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:21,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:37:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:37:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:37:21,694 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-07 10:37:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:21,719 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-07 10:37:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:37:21,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 10:37:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:21,728 INFO L225 Difference]: With dead ends: 45 [2018-11-07 10:37:21,729 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 10:37:21,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:37:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 10:37:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 10:37:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 10:37:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 10:37:21,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 10:37:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:21,772 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 10:37:21,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:37:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 10:37:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 10:37:21,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:21,773 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 10:37:21,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:21,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:21,774 INFO L82 PathProgramCache]: Analyzing trace with hash 800081396, now seen corresponding path program 1 times [2018-11-07 10:37:21,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:21,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:21,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:21,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:21,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:21,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:21,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:21,966 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-07 10:37:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:22,119 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-07 10:37:22,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:22,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-07 10:37:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:22,121 INFO L225 Difference]: With dead ends: 32 [2018-11-07 10:37:22,121 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 10:37:22,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 10:37:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 10:37:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 10:37:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 10:37:22,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-07 10:37:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:22,128 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 10:37:22,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 10:37:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 10:37:22,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:22,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:22,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:22,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1097925811, now seen corresponding path program 1 times [2018-11-07 10:37:22,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:22,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:22,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:37:22,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:22,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:22,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:22,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:22,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:22,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:22,214 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-07 10:37:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:22,377 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-07 10:37:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:37:22,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-07 10:37:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:22,380 INFO L225 Difference]: With dead ends: 35 [2018-11-07 10:37:22,380 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 10:37:22,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 10:37:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-07 10:37:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 10:37:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-07 10:37:22,386 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-11-07 10:37:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:22,386 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-07 10:37:22,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-07 10:37:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 10:37:22,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:22,389 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:22,389 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:22,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash -278190259, now seen corresponding path program 1 times [2018-11-07 10:37:22,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:22,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:22,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:22,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:22,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:22,638 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 10:37:22,640 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-07 10:37:22,673 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:37:22,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:37:22,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:37:22,913 INFO L272 AbstractInterpreter]: Visited 19 different actions 37 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-07 10:37:22,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:22,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:37:22,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:22,963 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:22,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:22,979 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:23,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:23,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:23,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:23,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-07 10:37:23,388 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:23,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:37:23,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:37:23,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:37:23,390 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-07 10:37:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:23,629 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-07 10:37:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:37:23,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 10:37:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:23,631 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:37:23,632 INFO L226 Difference]: Without dead ends: 53 [2018-11-07 10:37:23,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:37:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-07 10:37:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-07 10:37:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 10:37:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 10:37:23,641 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 21 [2018-11-07 10:37:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:23,642 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 10:37:23,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:37:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 10:37:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 10:37:23,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:23,643 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:23,644 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:23,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2006845708, now seen corresponding path program 1 times [2018-11-07 10:37:23,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:23,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:23,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:23,799 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 10:37:23,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:23,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:23,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-07 10:37:23,801 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [17], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-07 10:37:23,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:37:23,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:37:23,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:37:23,895 INFO L272 AbstractInterpreter]: Visited 20 different actions 57 times. Merged at 10 different actions 23 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 7 variables. [2018-11-07 10:37:23,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:23,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:37:23,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:23,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:23,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:23,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:23,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:24,063 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 10:37:24,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:24,516 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 10:37:24,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:24,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 10:37:24,537 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:24,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:37:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:37:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:37:24,539 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-11-07 10:37:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:24,698 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-07 10:37:24,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:37:24,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-07 10:37:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:24,701 INFO L225 Difference]: With dead ends: 75 [2018-11-07 10:37:24,701 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:37:24,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:37:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:37:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2018-11-07 10:37:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 10:37:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 10:37:24,709 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2018-11-07 10:37:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:24,710 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 10:37:24,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:37:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 10:37:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 10:37:24,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:24,711 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:24,711 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:24,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash 750227251, now seen corresponding path program 2 times [2018-11-07 10:37:24,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:24,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:24,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:24,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:24,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:24,865 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:24,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:24,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:24,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:24,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:24,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:24,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:37:24,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:24,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 10:37:25,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 10:37:25,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:25,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2018-11-07 10:37:25,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:25,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:37:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:37:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:37:25,238 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-11-07 10:37:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:25,544 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-11-07 10:37:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:37:25,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-07 10:37:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:25,546 INFO L225 Difference]: With dead ends: 112 [2018-11-07 10:37:25,546 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 10:37:25,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:37:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 10:37:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-11-07 10:37:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 10:37:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-07 10:37:25,555 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 33 [2018-11-07 10:37:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:25,556 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-07 10:37:25,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:37:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-07 10:37:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 10:37:25,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:25,558 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:25,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:25,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1707835635, now seen corresponding path program 3 times [2018-11-07 10:37:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:25,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:25,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:25,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:25,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:25,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:25,900 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:25,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:25,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:25,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:25,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:25,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:25,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:25,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:25,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:25,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:26,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:26,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 10:37:26,334 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:26,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:37:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:37:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:26,336 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2018-11-07 10:37:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:26,480 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-11-07 10:37:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:37:26,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-07 10:37:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:26,483 INFO L225 Difference]: With dead ends: 122 [2018-11-07 10:37:26,483 INFO L226 Difference]: Without dead ends: 116 [2018-11-07 10:37:26,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:37:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-07 10:37:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 77. [2018-11-07 10:37:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 10:37:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-07 10:37:26,493 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 45 [2018-11-07 10:37:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:26,493 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-07 10:37:26,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:37:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-07 10:37:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 10:37:26,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:26,495 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:26,496 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:26,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1071743214, now seen corresponding path program 4 times [2018-11-07 10:37:26,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:26,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:26,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:26,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:26,751 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:26,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:26,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,751 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:26,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:26,765 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:26,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:26,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:27,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:27,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 10:37:27,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:27,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:37:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:37:27,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:37:27,235 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 15 states. [2018-11-07 10:37:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:27,465 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-11-07 10:37:27,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:37:27,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-07 10:37:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:27,472 INFO L225 Difference]: With dead ends: 129 [2018-11-07 10:37:27,473 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 10:37:27,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:37:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 10:37:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2018-11-07 10:37:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 10:37:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-07 10:37:27,482 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 48 [2018-11-07 10:37:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:27,482 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-07 10:37:27,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:37:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-07 10:37:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 10:37:27,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:27,484 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:27,484 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:27,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash 535766893, now seen corresponding path program 5 times [2018-11-07 10:37:27,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:27,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:27,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:27,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:27,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:27,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:27,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:27,770 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:27,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:27,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:27,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:27,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:27,780 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:27,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:37:27,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:27,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 10:37:27,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 10:37:28,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 26 [2018-11-07 10:37:28,078 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:28,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:37:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:37:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:28,079 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 20 states. [2018-11-07 10:37:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:28,439 INFO L93 Difference]: Finished difference Result 181 states and 202 transitions. [2018-11-07 10:37:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:37:28,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-11-07 10:37:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:28,441 INFO L225 Difference]: With dead ends: 181 [2018-11-07 10:37:28,441 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 10:37:28,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:37:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 10:37:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2018-11-07 10:37:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:37:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-11-07 10:37:28,453 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 51 [2018-11-07 10:37:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:28,454 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-11-07 10:37:28,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:37:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-11-07 10:37:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 10:37:28,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:28,456 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:28,456 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:28,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash 227276404, now seen corresponding path program 6 times [2018-11-07 10:37:28,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:28,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:28,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:28,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:28,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:28,756 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:28,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:28,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:28,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:28,764 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:28,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:28,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:28,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:28,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:29,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:29,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 10:37:29,482 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:29,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:37:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:37:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:37:29,484 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 21 states. [2018-11-07 10:37:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:29,647 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-11-07 10:37:29,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:37:29,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-07 10:37:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:29,649 INFO L225 Difference]: With dead ends: 186 [2018-11-07 10:37:29,649 INFO L226 Difference]: Without dead ends: 180 [2018-11-07 10:37:29,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:37:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-07 10:37:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 122. [2018-11-07 10:37:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 10:37:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-11-07 10:37:29,662 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 66 [2018-11-07 10:37:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:29,663 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-11-07 10:37:29,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:37:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-07 10:37:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:29,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:29,665 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:29,665 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:29,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1732418355, now seen corresponding path program 7 times [2018-11-07 10:37:29,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:29,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:29,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:29,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:29,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:29,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:29,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:29,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:29,958 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 10:37:29,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:29,968 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:30,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:30,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:30,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:30,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 10:37:30,917 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:30,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:37:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:37:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:37:30,919 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 22 states. [2018-11-07 10:37:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:31,114 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2018-11-07 10:37:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:37:31,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-11-07 10:37:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:31,117 INFO L225 Difference]: With dead ends: 193 [2018-11-07 10:37:31,117 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 10:37:31,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:37:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 10:37:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 129. [2018-11-07 10:37:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 10:37:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2018-11-07 10:37:31,126 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 69 [2018-11-07 10:37:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:31,127 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2018-11-07 10:37:31,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:37:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2018-11-07 10:37:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-07 10:37:31,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:31,128 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:31,129 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:31,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1957710356, now seen corresponding path program 8 times [2018-11-07 10:37:31,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:31,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:31,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:31,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:31,418 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:31,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:31,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:31,418 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 10:37:31,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:31,430 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:31,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:37:31,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:31,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-07 10:37:32,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-07 10:37:32,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:32,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9, 9] total 35 [2018-11-07 10:37:32,262 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:32,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:37:32,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:37:32,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 10:37:32,263 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 28 states. [2018-11-07 10:37:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:32,603 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2018-11-07 10:37:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:37:32,604 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2018-11-07 10:37:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:32,606 INFO L225 Difference]: With dead ends: 263 [2018-11-07 10:37:32,606 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 10:37:32,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:37:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 10:37:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2018-11-07 10:37:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:37:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-07 10:37:32,616 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 72 [2018-11-07 10:37:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:32,616 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-07 10:37:32,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:37:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-07 10:37:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 10:37:32,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:32,618 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:32,619 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:32,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1693515634, now seen corresponding path program 9 times [2018-11-07 10:37:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:32,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:32,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:33,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:33,458 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:33,458 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:33,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:33,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:33,458 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 10:37:33,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:33,467 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:33,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:33,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:33,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:33,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:35,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:35,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-07 10:37:35,091 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:35,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:37:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:37:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:37:35,093 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 29 states. [2018-11-07 10:37:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:35,376 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2018-11-07 10:37:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:37:35,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-11-07 10:37:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:35,381 INFO L225 Difference]: With dead ends: 260 [2018-11-07 10:37:35,381 INFO L226 Difference]: Without dead ends: 254 [2018-11-07 10:37:35,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:37:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-07 10:37:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 174. [2018-11-07 10:37:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 10:37:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2018-11-07 10:37:35,390 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 90 [2018-11-07 10:37:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:35,390 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2018-11-07 10:37:35,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:37:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2018-11-07 10:37:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 10:37:35,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:35,393 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:35,393 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:35,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1143150669, now seen corresponding path program 10 times [2018-11-07 10:37:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:35,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:35,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:35,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:35,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:35,926 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:35,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:35,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:35,926 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 10:37:35,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:35,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:35,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:36,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:36,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:36,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 10:37:36,948 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:36,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:37:36,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:37:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 10:37:36,950 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand 30 states. [2018-11-07 10:37:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:37,213 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2018-11-07 10:37:37,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 10:37:37,214 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-11-07 10:37:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:37,216 INFO L225 Difference]: With dead ends: 267 [2018-11-07 10:37:37,216 INFO L226 Difference]: Without dead ends: 261 [2018-11-07 10:37:37,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 10:37:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-07 10:37:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 181. [2018-11-07 10:37:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-07 10:37:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-11-07 10:37:37,223 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 93 [2018-11-07 10:37:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:37,224 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-11-07 10:37:37,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:37:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-11-07 10:37:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-07 10:37:37,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:37,226 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:37,226 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:37,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 492467246, now seen corresponding path program 11 times [2018-11-07 10:37:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:37,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:37,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:37,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:37,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:37,687 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:37,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:37,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:37,687 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 10:37:37,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:37,695 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:37,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:37:37,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:37,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-07 10:37:37,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-07 10:37:38,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:38,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10, 10] total 45 [2018-11-07 10:37:38,199 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:38,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:37:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:37:38,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:37:38,200 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 37 states. [2018-11-07 10:37:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:38,790 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2018-11-07 10:37:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:37:38,792 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-11-07 10:37:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:38,795 INFO L225 Difference]: With dead ends: 358 [2018-11-07 10:37:38,795 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 10:37:38,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:37:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 10:37:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 226. [2018-11-07 10:37:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-07 10:37:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2018-11-07 10:37:38,805 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 254 transitions. Word has length 96 [2018-11-07 10:37:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:38,805 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 254 transitions. [2018-11-07 10:37:38,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:37:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 254 transitions. [2018-11-07 10:37:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 10:37:38,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:38,808 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:38,808 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:38,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 494608371, now seen corresponding path program 12 times [2018-11-07 10:37:38,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:38,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:38,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:39,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:39,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:39,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:39,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:39,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:39,435 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 10:37:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:39,446 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:39,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:39,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:39,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:39,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:41,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-07 10:37:41,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:41,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:37:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:37:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:37:41,141 INFO L87 Difference]: Start difference. First operand 226 states and 254 transitions. Second operand 38 states. [2018-11-07 10:37:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:41,562 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-11-07 10:37:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:37:41,562 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-11-07 10:37:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:41,565 INFO L225 Difference]: With dead ends: 344 [2018-11-07 10:37:41,565 INFO L226 Difference]: Without dead ends: 338 [2018-11-07 10:37:41,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:37:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-07 10:37:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 233. [2018-11-07 10:37:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-07 10:37:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-11-07 10:37:41,574 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 117 [2018-11-07 10:37:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:41,574 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-11-07 10:37:41,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:37:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-11-07 10:37:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 10:37:41,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:41,576 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:41,576 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:41,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash -612030252, now seen corresponding path program 13 times [2018-11-07 10:37:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:42,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:42,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:42,148 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:42,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:42,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:42,148 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 10:37:42,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:42,156 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:42,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:42,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:43,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:43,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 10:37:43,985 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:43,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:37:43,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:37:43,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:37:43,988 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 39 states. [2018-11-07 10:37:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:44,433 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-11-07 10:37:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:37:44,434 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-11-07 10:37:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:44,436 INFO L225 Difference]: With dead ends: 351 [2018-11-07 10:37:44,436 INFO L226 Difference]: Without dead ends: 345 [2018-11-07 10:37:44,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:37:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-07 10:37:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 240. [2018-11-07 10:37:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 10:37:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2018-11-07 10:37:44,445 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 120 [2018-11-07 10:37:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:44,446 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2018-11-07 10:37:44,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:37:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2018-11-07 10:37:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 10:37:44,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:44,447 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:44,448 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:44,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -314283949, now seen corresponding path program 14 times [2018-11-07 10:37:44,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:44,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 1368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:45,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:45,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:45,415 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:45,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:45,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:45,415 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 10:37:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:45,423 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:45,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:37:45,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:45,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-07 10:37:45,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-07 10:37:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:46,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 11, 11] total 56 [2018-11-07 10:37:46,090 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:46,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:37:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:37:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:37:46,092 INFO L87 Difference]: Start difference. First operand 240 states and 270 transitions. Second operand 47 states. [2018-11-07 10:37:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:47,082 INFO L93 Difference]: Finished difference Result 466 states and 517 transitions. [2018-11-07 10:37:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:37:47,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 123 [2018-11-07 10:37:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:47,085 INFO L225 Difference]: With dead ends: 466 [2018-11-07 10:37:47,085 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 10:37:47,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:37:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 10:37:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 292. [2018-11-07 10:37:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-07 10:37:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 329 transitions. [2018-11-07 10:37:47,100 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 329 transitions. Word has length 123 [2018-11-07 10:37:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:47,101 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 329 transitions. [2018-11-07 10:37:47,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:37:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 329 transitions. [2018-11-07 10:37:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 10:37:47,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:47,103 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:47,103 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:47,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash -755226131, now seen corresponding path program 15 times [2018-11-07 10:37:47,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:47,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:47,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:48,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:48,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:48,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:48,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:48,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:48,571 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 10:37:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:48,581 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:48,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:48,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:48,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:48,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:51,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:51,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 10:37:51,404 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:51,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:37:51,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:37:51,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:37:51,407 INFO L87 Difference]: Start difference. First operand 292 states and 329 transitions. Second operand 48 states. [2018-11-07 10:37:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:51,991 INFO L93 Difference]: Finished difference Result 438 states and 483 transitions. [2018-11-07 10:37:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 10:37:51,991 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-11-07 10:37:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:51,994 INFO L225 Difference]: With dead ends: 438 [2018-11-07 10:37:51,995 INFO L226 Difference]: Without dead ends: 432 [2018-11-07 10:37:51,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:37:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-07 10:37:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 299. [2018-11-07 10:37:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-07 10:37:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 337 transitions. [2018-11-07 10:37:52,003 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 337 transitions. Word has length 147 [2018-11-07 10:37:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:52,004 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 337 transitions. [2018-11-07 10:37:52,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:37:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 337 transitions. [2018-11-07 10:37:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 10:37:52,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:52,005 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:52,006 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:52,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:52,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1973406962, now seen corresponding path program 16 times [2018-11-07 10:37:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:52,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:52,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:53,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:53,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:53,838 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:53,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:53,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:53,838 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 10:37:53,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:53,850 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:53,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:53,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:56,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:56,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 10:37:56,344 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:56,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 10:37:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 10:37:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 10:37:56,346 INFO L87 Difference]: Start difference. First operand 299 states and 337 transitions. Second operand 49 states. [2018-11-07 10:37:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:57,183 INFO L93 Difference]: Finished difference Result 445 states and 491 transitions. [2018-11-07 10:37:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:37:57,183 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-11-07 10:37:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:57,187 INFO L225 Difference]: With dead ends: 445 [2018-11-07 10:37:57,187 INFO L226 Difference]: Without dead ends: 439 [2018-11-07 10:37:57,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:37:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-07 10:37:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 306. [2018-11-07 10:37:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-07 10:37:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 345 transitions. [2018-11-07 10:37:57,195 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 345 transitions. Word has length 150 [2018-11-07 10:37:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:57,196 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 345 transitions. [2018-11-07 10:37:57,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 10:37:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 345 transitions. [2018-11-07 10:37:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 10:37:57,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:57,198 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:57,198 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:57,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash -324892083, now seen corresponding path program 17 times [2018-11-07 10:37:57,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:57,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 2307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:58,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:58,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:58,113 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:58,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:58,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:58,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:58,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:58,123 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:58,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:37:58,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:58,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-07 10:37:58,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-07 10:38:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:01,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 12, 12] total 68 [2018-11-07 10:38:01,040 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:01,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 10:38:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 10:38:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:38:01,041 INFO L87 Difference]: Start difference. First operand 306 states and 345 transitions. Second operand 58 states. [2018-11-07 10:38:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:01,992 INFO L93 Difference]: Finished difference Result 587 states and 650 transitions. [2018-11-07 10:38:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 10:38:01,992 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 153 [2018-11-07 10:38:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:01,995 INFO L225 Difference]: With dead ends: 587 [2018-11-07 10:38:01,995 INFO L226 Difference]: Without dead ends: 565 [2018-11-07 10:38:01,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:38:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-07 10:38:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 365. [2018-11-07 10:38:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-07 10:38:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 412 transitions. [2018-11-07 10:38:02,005 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 412 transitions. Word has length 153 [2018-11-07 10:38:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:02,005 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 412 transitions. [2018-11-07 10:38:02,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 10:38:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 412 transitions. [2018-11-07 10:38:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-07 10:38:02,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:02,007 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:02,007 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:02,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 752334548, now seen corresponding path program 18 times [2018-11-07 10:38:02,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:02,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:02,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:03,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:03,297 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:03,297 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:03,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:03,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:03,297 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:03,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:03,307 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:03,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:03,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:03,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:03,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:07,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:07,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-07 10:38:07,093 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:07,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 10:38:07,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 10:38:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 10:38:07,096 INFO L87 Difference]: Start difference. First operand 365 states and 412 transitions. Second operand 59 states. [2018-11-07 10:38:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:08,304 INFO L93 Difference]: Finished difference Result 542 states and 598 transitions. [2018-11-07 10:38:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:38:08,307 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 180 [2018-11-07 10:38:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:08,310 INFO L225 Difference]: With dead ends: 542 [2018-11-07 10:38:08,310 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 10:38:08,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 10:38:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 10:38:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 372. [2018-11-07 10:38:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-07 10:38:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 420 transitions. [2018-11-07 10:38:08,318 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 420 transitions. Word has length 180 [2018-11-07 10:38:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:08,319 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 420 transitions. [2018-11-07 10:38:08,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 10:38:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 420 transitions. [2018-11-07 10:38:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 10:38:08,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:08,321 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:08,321 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:08,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:08,321 INFO L82 PathProgramCache]: Analyzing trace with hash -252635693, now seen corresponding path program 19 times [2018-11-07 10:38:08,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:08,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:08,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:09,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:09,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:09,982 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:09,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:09,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:09,983 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:09,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:09,992 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:10,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:10,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:13,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:13,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-07 10:38:13,545 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:13,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 10:38:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 10:38:13,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 10:38:13,547 INFO L87 Difference]: Start difference. First operand 372 states and 420 transitions. Second operand 60 states. [2018-11-07 10:38:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:14,800 INFO L93 Difference]: Finished difference Result 549 states and 606 transitions. [2018-11-07 10:38:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 10:38:14,801 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 183 [2018-11-07 10:38:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:14,805 INFO L225 Difference]: With dead ends: 549 [2018-11-07 10:38:14,805 INFO L226 Difference]: Without dead ends: 543 [2018-11-07 10:38:14,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2018-11-07 10:38:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-11-07 10:38:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2018-11-07 10:38:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 10:38:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 428 transitions. [2018-11-07 10:38:14,814 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 428 transitions. Word has length 183 [2018-11-07 10:38:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:14,815 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 428 transitions. [2018-11-07 10:38:14,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 10:38:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 428 transitions. [2018-11-07 10:38:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 10:38:14,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:14,816 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:14,817 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:14,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash 895935092, now seen corresponding path program 20 times [2018-11-07 10:38:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:14,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 3636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:16,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:16,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:16,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:16,395 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:16,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:16,403 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:16,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:38:16,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:16,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-11-07 10:38:16,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-11-07 10:38:17,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:17,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 13, 13] total 81 [2018-11-07 10:38:17,429 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:17,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 10:38:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 10:38:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2936, Invalid=3544, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:38:17,430 INFO L87 Difference]: Start difference. First operand 379 states and 428 transitions. Second operand 70 states. [2018-11-07 10:38:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:19,759 INFO L93 Difference]: Finished difference Result 721 states and 797 transitions. [2018-11-07 10:38:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 10:38:19,760 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 186 [2018-11-07 10:38:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:19,764 INFO L225 Difference]: With dead ends: 721 [2018-11-07 10:38:19,764 INFO L226 Difference]: Without dead ends: 697 [2018-11-07 10:38:19,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2942, Invalid=3700, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:38:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-07 10:38:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 445. [2018-11-07 10:38:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-11-07 10:38:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 503 transitions. [2018-11-07 10:38:19,774 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 503 transitions. Word has length 186 [2018-11-07 10:38:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:19,774 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 503 transitions. [2018-11-07 10:38:19,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 10:38:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 503 transitions. [2018-11-07 10:38:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 10:38:19,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:19,776 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:19,776 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:19,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1102113070, now seen corresponding path program 21 times [2018-11-07 10:38:19,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:19,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:19,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:21,548 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:21,548 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:21,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:21,549 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:21,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:21,573 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:21,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:21,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:21,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:21,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:26,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:26,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-07 10:38:26,973 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:26,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-07 10:38:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-07 10:38:26,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 10:38:26,974 INFO L87 Difference]: Start difference. First operand 445 states and 503 transitions. Second operand 71 states. [2018-11-07 10:38:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:29,213 INFO L93 Difference]: Finished difference Result 656 states and 724 transitions. [2018-11-07 10:38:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 10:38:29,213 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 216 [2018-11-07 10:38:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:29,217 INFO L225 Difference]: With dead ends: 656 [2018-11-07 10:38:29,217 INFO L226 Difference]: Without dead ends: 650 [2018-11-07 10:38:29,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2018-11-07 10:38:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-07 10:38:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 452. [2018-11-07 10:38:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-07 10:38:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2018-11-07 10:38:29,227 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 216 [2018-11-07 10:38:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:29,228 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2018-11-07 10:38:29,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-07 10:38:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2018-11-07 10:38:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 10:38:29,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:29,230 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:29,230 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:29,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash -518064979, now seen corresponding path program 22 times [2018-11-07 10:38:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:29,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:29,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:29,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:29,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:31,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:31,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:31,645 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:31,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:31,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:31,645 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:31,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:31,657 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:31,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:31,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2018-11-07 10:38:37,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:37,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 10:38:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 10:38:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2018-11-07 10:38:37,152 INFO L87 Difference]: Start difference. First operand 452 states and 511 transitions. Second operand 72 states. [2018-11-07 10:38:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:39,447 INFO L93 Difference]: Finished difference Result 663 states and 732 transitions. [2018-11-07 10:38:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 10:38:39,448 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 219 [2018-11-07 10:38:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:39,450 INFO L225 Difference]: With dead ends: 663 [2018-11-07 10:38:39,450 INFO L226 Difference]: Without dead ends: 657 [2018-11-07 10:38:39,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2018-11-07 10:38:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-07 10:38:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 459. [2018-11-07 10:38:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-11-07 10:38:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 519 transitions. [2018-11-07 10:38:39,462 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 519 transitions. Word has length 219 [2018-11-07 10:38:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:39,462 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 519 transitions. [2018-11-07 10:38:39,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 10:38:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 519 transitions. [2018-11-07 10:38:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-07 10:38:39,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:39,464 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:39,464 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:39,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash -399850290, now seen corresponding path program 23 times [2018-11-07 10:38:39,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:39,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:39,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:42,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:42,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:42,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:42,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:42,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:42,122 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:42,133 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:42,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:38:42,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:42,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-07 10:38:42,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-07 10:38:43,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:43,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 14, 14] total 95 [2018-11-07 10:38:43,623 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:43,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-11-07 10:38:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-11-07 10:38:43,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:38:43,625 INFO L87 Difference]: Start difference. First operand 459 states and 519 transitions. Second operand 83 states. [2018-11-07 10:38:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:46,094 INFO L93 Difference]: Finished difference Result 868 states and 958 transitions. [2018-11-07 10:38:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-07 10:38:46,095 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 222 [2018-11-07 10:38:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:46,097 INFO L225 Difference]: With dead ends: 868 [2018-11-07 10:38:46,098 INFO L226 Difference]: Without dead ends: 842 [2018-11-07 10:38:46,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 10:38:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-07 10:38:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 532. [2018-11-07 10:38:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-07 10:38:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 602 transitions. [2018-11-07 10:38:46,108 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 602 transitions. Word has length 222 [2018-11-07 10:38:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:46,108 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 602 transitions. [2018-11-07 10:38:46,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-11-07 10:38:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 602 transitions. [2018-11-07 10:38:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 10:38:46,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:46,111 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:46,111 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:46,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1768862701, now seen corresponding path program 24 times [2018-11-07 10:38:46,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:46,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:46,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:46,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:46,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:48,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:48,558 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:48,558 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:48,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:48,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:48,559 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:48,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:48,585 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:48,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:48,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:48,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:48,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:56,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:56,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 166 [2018-11-07 10:38:56,305 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:56,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-07 10:38:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-07 10:38:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2018-11-07 10:38:56,308 INFO L87 Difference]: Start difference. First operand 532 states and 602 transitions. Second operand 84 states. [2018-11-07 10:38:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:59,199 INFO L93 Difference]: Finished difference Result 780 states and 861 transitions. [2018-11-07 10:38:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 10:38:59,199 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 255 [2018-11-07 10:38:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:59,205 INFO L225 Difference]: With dead ends: 780 [2018-11-07 10:38:59,205 INFO L226 Difference]: Without dead ends: 774 [2018-11-07 10:38:59,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2018-11-07 10:38:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-07 10:38:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 539. [2018-11-07 10:38:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 10:38:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 610 transitions. [2018-11-07 10:38:59,215 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 610 transitions. Word has length 255 [2018-11-07 10:38:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:59,216 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 610 transitions. [2018-11-07 10:38:59,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-07 10:38:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 610 transitions. [2018-11-07 10:38:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-07 10:38:59,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:59,218 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:59,219 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:59,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash 412573620, now seen corresponding path program 25 times [2018-11-07 10:38:59,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:59,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:59,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:02,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:02,129 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:02,129 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:02,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:02,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:02,129 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:02,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:02,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:02,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:09,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:09,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 168 [2018-11-07 10:39:09,710 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:09,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-07 10:39:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-07 10:39:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2018-11-07 10:39:09,712 INFO L87 Difference]: Start difference. First operand 539 states and 610 transitions. Second operand 85 states. [2018-11-07 10:39:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:13,388 INFO L93 Difference]: Finished difference Result 787 states and 869 transitions. [2018-11-07 10:39:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-07 10:39:13,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 258 [2018-11-07 10:39:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:13,394 INFO L225 Difference]: With dead ends: 787 [2018-11-07 10:39:13,394 INFO L226 Difference]: Without dead ends: 781 [2018-11-07 10:39:13,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2018-11-07 10:39:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-11-07 10:39:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 546. [2018-11-07 10:39:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-07 10:39:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 618 transitions. [2018-11-07 10:39:13,404 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 618 transitions. Word has length 258 [2018-11-07 10:39:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:13,404 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 618 transitions. [2018-11-07 10:39:13,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-07 10:39:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 618 transitions. [2018-11-07 10:39:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 10:39:13,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:13,407 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:13,407 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:13,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:13,407 INFO L82 PathProgramCache]: Analyzing trace with hash 431856755, now seen corresponding path program 26 times [2018-11-07 10:39:13,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:13,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:13,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:13,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:13,408 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 7833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:16,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:16,338 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:16,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:16,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:16,339 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:16,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:16,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:39:16,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:16,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 7668 trivial. 0 not checked. [2018-11-07 10:39:18,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 7668 trivial. 0 not checked. [2018-11-07 10:39:19,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:19,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 15, 15] total 110 [2018-11-07 10:39:19,352 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:19,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 10:39:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 10:39:19,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:39:19,354 INFO L87 Difference]: Start difference. First operand 546 states and 618 transitions. Second operand 97 states. [2018-11-07 10:39:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:23,717 INFO L93 Difference]: Finished difference Result 1028 states and 1133 transitions. [2018-11-07 10:39:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-07 10:39:23,717 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 261 [2018-11-07 10:39:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:23,721 INFO L225 Difference]: With dead ends: 1028 [2018-11-07 10:39:23,722 INFO L226 Difference]: Without dead ends: 1000 [2018-11-07 10:39:23,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 10:39:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-11-07 10:39:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 626. [2018-11-07 10:39:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-07 10:39:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 709 transitions. [2018-11-07 10:39:23,730 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 709 transitions. Word has length 261 [2018-11-07 10:39:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:23,731 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 709 transitions. [2018-11-07 10:39:23,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 10:39:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 709 transitions. [2018-11-07 10:39:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 10:39:23,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:23,733 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:23,734 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:23,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1637142579, now seen corresponding path program 27 times [2018-11-07 10:39:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:23,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:23,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:27,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:27,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:27,302 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:27,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:27,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:27,303 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:27,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:27,313 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:27,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:27,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:27,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:27,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:37,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 194 [2018-11-07 10:39:37,597 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:37,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-07 10:39:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-07 10:39:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17965, Invalid=19477, Unknown=0, NotChecked=0, Total=37442 [2018-11-07 10:39:37,599 INFO L87 Difference]: Start difference. First operand 626 states and 709 transitions. Second operand 98 states. [2018-11-07 10:39:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:43,164 INFO L93 Difference]: Finished difference Result 914 states and 1009 transitions. [2018-11-07 10:39:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-07 10:39:43,165 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 297 [2018-11-07 10:39:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:43,169 INFO L225 Difference]: With dead ends: 914 [2018-11-07 10:39:43,169 INFO L226 Difference]: Without dead ends: 908 [2018-11-07 10:39:43,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=17971, Invalid=19859, Unknown=0, NotChecked=0, Total=37830 [2018-11-07 10:39:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-07 10:39:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 633. [2018-11-07 10:39:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-07 10:39:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 717 transitions. [2018-11-07 10:39:43,180 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 717 transitions. Word has length 297 [2018-11-07 10:39:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:43,180 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 717 transitions. [2018-11-07 10:39:43,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-07 10:39:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 717 transitions. [2018-11-07 10:39:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-07 10:39:43,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:43,183 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:43,183 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:43,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:43,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1112549934, now seen corresponding path program 28 times [2018-11-07 10:39:43,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:43,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:43,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:43,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:43,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:47,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:47,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:47,889 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:47,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:47,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:47,890 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:47,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:47,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:47,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:48,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:39:58,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:58,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 196 [2018-11-07 10:39:58,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:58,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-07 10:39:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-07 10:39:58,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18346, Invalid=19874, Unknown=0, NotChecked=0, Total=38220 [2018-11-07 10:39:58,247 INFO L87 Difference]: Start difference. First operand 633 states and 717 transitions. Second operand 99 states. [2018-11-07 10:40:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:04,071 INFO L93 Difference]: Finished difference Result 921 states and 1017 transitions. [2018-11-07 10:40:04,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-07 10:40:04,072 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 300 [2018-11-07 10:40:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:04,075 INFO L225 Difference]: With dead ends: 921 [2018-11-07 10:40:04,075 INFO L226 Difference]: Without dead ends: 915 [2018-11-07 10:40:04,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 503 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=18352, Invalid=20260, Unknown=0, NotChecked=0, Total=38612 [2018-11-07 10:40:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-11-07 10:40:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 640. [2018-11-07 10:40:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-07 10:40:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2018-11-07 10:40:04,086 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 300 [2018-11-07 10:40:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:04,086 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2018-11-07 10:40:04,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-07 10:40:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2018-11-07 10:40:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-07 10:40:04,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:04,089 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:04,089 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:04,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash -709031891, now seen corresponding path program 29 times [2018-11-07 10:40:04,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:04,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:04,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:04,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 10908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:08,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:08,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:08,935 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:08,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:08,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:08,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:08,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:08,944 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:08,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:40:08,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:08,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 10710 trivial. 0 not checked. [2018-11-07 10:40:10,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 10710 trivial. 0 not checked. [2018-11-07 10:40:11,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:11,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 16, 16] total 126 [2018-11-07 10:40:11,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:11,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-11-07 10:40:11,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-11-07 10:40:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 10:40:11,135 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand 112 states. [2018-11-07 10:40:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:16,398 INFO L93 Difference]: Finished difference Result 1201 states and 1322 transitions. [2018-11-07 10:40:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-11-07 10:40:16,398 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 303 [2018-11-07 10:40:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:16,403 INFO L225 Difference]: With dead ends: 1201 [2018-11-07 10:40:16,403 INFO L226 Difference]: Without dead ends: 1171 [2018-11-07 10:40:16,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 580 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2018-11-07 10:40:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-11-07 10:40:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 727. [2018-11-07 10:40:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-07 10:40:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 824 transitions. [2018-11-07 10:40:16,413 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 824 transitions. Word has length 303 [2018-11-07 10:40:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:16,413 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 824 transitions. [2018-11-07 10:40:16,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-11-07 10:40:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 824 transitions. [2018-11-07 10:40:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-07 10:40:16,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:16,416 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:16,416 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:16,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1992803276, now seen corresponding path program 30 times [2018-11-07 10:40:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:16,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:21,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:21,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:21,593 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:21,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:21,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:21,593 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:21,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:21,622 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:21,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:21,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:21,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:22,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:34,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:34,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 206 [2018-11-07 10:40:34,488 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:34,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-11-07 10:40:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-11-07 10:40:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2018-11-07 10:40:34,492 INFO L87 Difference]: Start difference. First operand 727 states and 824 transitions. Second operand 113 states. [2018-11-07 10:40:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:43,022 INFO L93 Difference]: Finished difference Result 893 states and 1003 transitions. [2018-11-07 10:40:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-11-07 10:40:43,023 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 342 [2018-11-07 10:40:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:43,027 INFO L225 Difference]: With dead ends: 893 [2018-11-07 10:40:43,027 INFO L226 Difference]: Without dead ends: 887 [2018-11-07 10:40:43,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 573 SyntacticMatches, 19 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2018-11-07 10:40:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-07 10:40:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 734. [2018-11-07 10:40:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-07 10:40:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 832 transitions. [2018-11-07 10:40:43,037 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 832 transitions. Word has length 342 [2018-11-07 10:40:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:43,038 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 832 transitions. [2018-11-07 10:40:43,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-11-07 10:40:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 832 transitions. [2018-11-07 10:40:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-07 10:40:43,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:43,041 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:43,041 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:43,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -294769805, now seen corresponding path program 31 times [2018-11-07 10:40:43,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:48,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:48,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:48,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:48,258 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:48,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:48,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:48,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 206 [2018-11-07 10:41:00,399 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:00,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-11-07 10:41:00,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-11-07 10:41:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2018-11-07 10:41:00,402 INFO L87 Difference]: Start difference. First operand 734 states and 832 transitions. Second operand 114 states. [2018-11-07 10:41:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:07,511 INFO L93 Difference]: Finished difference Result 867 states and 978 transitions. [2018-11-07 10:41:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-11-07 10:41:07,512 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 345 [2018-11-07 10:41:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:07,516 INFO L225 Difference]: With dead ends: 867 [2018-11-07 10:41:07,516 INFO L226 Difference]: Without dead ends: 861 [2018-11-07 10:41:07,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 578 SyntacticMatches, 21 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2018-11-07 10:41:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-07 10:41:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 741. [2018-11-07 10:41:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-07 10:41:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 840 transitions. [2018-11-07 10:41:07,525 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 840 transitions. Word has length 345 [2018-11-07 10:41:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:07,526 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 840 transitions. [2018-11-07 10:41:07,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-11-07 10:41:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 840 transitions. [2018-11-07 10:41:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-07 10:41:07,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:07,529 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:07,529 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:07,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash -304447532, now seen corresponding path program 32 times [2018-11-07 10:41:07,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:07,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:07,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:07,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 14787 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:13,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:13,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:13,083 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:13,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:13,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:13,083 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:41:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:13,092 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:13,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 10:41:13,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:13,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 14553 trivial. 0 not checked. [2018-11-07 10:41:13,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 14553 trivial. 0 not checked. [2018-11-07 10:41:15,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:15,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 17, 17] total 131 [2018-11-07 10:41:15,088 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:15,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-07 10:41:15,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-07 10:41:15,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8011, Invalid=9019, Unknown=0, NotChecked=0, Total=17030 [2018-11-07 10:41:15,091 INFO L87 Difference]: Start difference. First operand 741 states and 840 transitions. Second operand 116 states. [2018-11-07 10:41:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:22,823 INFO L93 Difference]: Finished difference Result 847 states and 961 transitions. [2018-11-07 10:41:22,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-11-07 10:41:22,824 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 348 [2018-11-07 10:41:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:22,828 INFO L225 Difference]: With dead ends: 847 [2018-11-07 10:41:22,828 INFO L226 Difference]: Without dead ends: 839 [2018-11-07 10:41:22,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 679 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8017, Invalid=9275, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 10:41:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-11-07 10:41:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 751. [2018-11-07 10:41:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-07 10:41:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 851 transitions. [2018-11-07 10:41:22,837 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 851 transitions. Word has length 348 [2018-11-07 10:41:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:22,838 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 851 transitions. [2018-11-07 10:41:22,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-11-07 10:41:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 851 transitions. [2018-11-07 10:41:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-07 10:41:22,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:22,841 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:22,841 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:22,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash -127276786, now seen corresponding path program 33 times [2018-11-07 10:41:22,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:22,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:22,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:22,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:22,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 10:41:23,439 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:41:23,444 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:41:23,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:41:23 BoogieIcfgContainer [2018-11-07 10:41:23,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:41:23,445 INFO L168 Benchmark]: Toolchain (without parser) took 243046.20 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 841.5 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -68.2 MB). Peak memory consumption was 773.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:23,447 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:41:23,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:23,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:41:23,449 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:41:23,449 INFO L168 Benchmark]: RCFGBuilder took 669.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:23,453 INFO L168 Benchmark]: TraceAbstraction took 241997.16 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 687.2 MB). Peak memory consumption was 807.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:23,457 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 669.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241997.16 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 687.2 MB). Peak memory consumption was 807.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 355 with TraceHistMax 100,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 353 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 241.9s OverallTime, 37 OverallIterations, 100 TraceHistogramMax, 70.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 13419 SDslu, 15498 SDs, 0 SdLazy, 10671 SolverSat, 4333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12672 GetRequests, 9564 SyntacticMatches, 72 SemanticMatches, 3036 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15512 ImplicationChecksByTransitivity, 160.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 4989 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 164.6s InterpolantComputationTime, 10931 NumberOfCodeBlocks, 9743 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 16268 ConstructedInterpolants, 0 QuantifiedInterpolants, 9423888 SizeOfPredicates, 78 NumberOfNonLiveVariables, 10115 ConjunctsInSsa, 1373 ConjunctsInUnsatCore, 102 InterpolantComputations, 3 PerfectInterpolantSequences, 92865/414984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown