java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:02:57,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:02:57,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:02:57,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:02:57,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:02:57,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:02:57,528 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:02:57,530 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:02:57,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:02:57,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:02:57,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:02:57,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:02:57,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:02:57,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:02:57,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:02:57,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:02:57,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:02:57,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:02:57,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:02:57,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:02:57,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:02:57,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:02:57,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:02:57,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:02:57,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:02:57,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:02:57,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:02:57,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:02:57,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:02:57,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:02:57,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:02:57,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:02:57,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:02:57,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:02:57,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:02:57,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:02:57,561 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:02:57,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:02:57,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:02:57,578 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:02:57,578 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:02:57,578 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:02:57,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:02:57,579 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:02:57,579 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:02:57,579 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:02:57,579 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:02:57,580 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:02:57,580 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:02:57,580 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:02:57,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:02:57,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:02:57,581 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:02:57,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:02:57,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:02:57,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:02:57,582 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:02:57,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:02:57,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:02:57,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:02:57,583 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:02:57,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:02:57,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:02:57,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:02:57,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:02:57,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:02:57,584 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:02:57,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:02:57,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:02:57,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:02:57,585 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:02:57,585 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:02:57,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:02:57,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:02:57,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:02:57,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:02:57,655 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:02:57,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-07 22:02:57,718 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedbb2ca7/d1be9f680fb648158c26b30036d5c7f6/FLAG1e05d23e7 [2018-11-07 22:02:58,226 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:02:58,226 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-07 22:02:58,233 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedbb2ca7/d1be9f680fb648158c26b30036d5c7f6/FLAG1e05d23e7 [2018-11-07 22:02:58,253 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedbb2ca7/d1be9f680fb648158c26b30036d5c7f6 [2018-11-07 22:02:58,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:02:58,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:02:58,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:02:58,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:02:58,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:02:58,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eddc215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58, skipping insertion in model container [2018-11-07 22:02:58,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:02:58,314 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:02:58,556 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:02:58,560 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:02:58,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:02:58,606 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:02:58,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58 WrapperNode [2018-11-07 22:02:58,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:02:58,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:02:58,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:02:58,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:02:58,620 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:02:58" (1/1) ... [2018-11-07 22:02:58,630 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:02:58" (1/1) ... [2018-11-07 22:02:58,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:02:58,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:02:58,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:02:58,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:02:58,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:02:58,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:02:58,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:02:58,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:02:58,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (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 22:02:58,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:02:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:02:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:02:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:02:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:02:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:02:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:02:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:02:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:02:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:02:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:02:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:02:59,252 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:02:59,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:59 BoogieIcfgContainer [2018-11-07 22:02:59,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:02:59,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:02:59,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:02:59,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:02:59,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:02:58" (1/3) ... [2018-11-07 22:02:59,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d93046e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:59, skipping insertion in model container [2018-11-07 22:02:59,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (2/3) ... [2018-11-07 22:02:59,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d93046e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:59, skipping insertion in model container [2018-11-07 22:02:59,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:59" (3/3) ... [2018-11-07 22:02:59,261 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call2_true-termination.i [2018-11-07 22:02:59,272 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:02:59,280 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:02:59,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:02:59,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:02:59,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:02:59,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:02:59,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:02:59,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:02:59,340 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:02:59,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:02:59,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:02:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-07 22:02:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:02:59,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,372 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1453247475, now seen corresponding path program 1 times [2018-11-07 22:02:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,518 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 22:02:59,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:02:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:02:59,520 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:02:59,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:02:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:02:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:02:59,541 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-07 22:02:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:59,568 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-07 22:02:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:02:59,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-07 22:02:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:59,578 INFO L225 Difference]: With dead ends: 50 [2018-11-07 22:02:59,578 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 22:02:59,581 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 22:02:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 22:02:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-07 22:02:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 22:02:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-07 22:02:59,618 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-11-07 22:02:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:59,619 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-07 22:02:59,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:02:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-07 22:02:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:02:59,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1440079151, now seen corresponding path program 1 times [2018-11-07 22:02:59,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,696 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 22:02:59,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:02:59,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:02:59,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:02:59,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:02:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:02:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:02:59,700 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-07 22:02:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:59,781 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-07 22:02:59,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:02:59,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-07 22:02:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:59,783 INFO L225 Difference]: With dead ends: 34 [2018-11-07 22:02:59,783 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 22:02:59,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:02:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 22:02:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-07 22:02:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 22:02:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-07 22:02:59,790 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2018-11-07 22:02:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:59,790 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-07 22:02:59,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:02:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-07 22:02:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 22:02:59,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,792 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1634508201, now seen corresponding path program 1 times [2018-11-07 22:02:59,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:02:59,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:59,905 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:59,906 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 22:02:59,908 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [19], [21], [25], [26], [34], [37], [39], [45], [46], [47], [49] [2018-11-07 22:02:59,950 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:02:59,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:03:00,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:03:00,207 INFO L272 AbstractInterpreter]: Visited 21 different actions 56 times. Merged at 6 different actions 30 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-07 22:03:00,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:00,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:03:00,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,230 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:03:00,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:00,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:00,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:00,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 22:03:00,474 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:00,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:03:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:03:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:03:00,475 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2018-11-07 22:03:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:00,543 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-07 22:03:00,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:03:00,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-07 22:03:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:00,544 INFO L225 Difference]: With dead ends: 40 [2018-11-07 22:03:00,545 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 22:03:00,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:03:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 22:03:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-07 22:03:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 22:03:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-07 22:03:00,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 22 [2018-11-07 22:03:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:00,552 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-07 22:03:00,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:03:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-07 22:03:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 22:03:00,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:00,554 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:00,554 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:00,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2041419393, now seen corresponding path program 2 times [2018-11-07 22:03:00,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:00,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:00,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:00,702 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:00,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:00,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,703 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 22:03:00,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:00,720 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:00,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:03:00,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:00,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:01,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 22:03:01,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:01,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:03:01,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:03:01,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:03:01,053 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 6 states. [2018-11-07 22:03:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:01,119 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-07 22:03:01,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:03:01,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-07 22:03:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:01,123 INFO L225 Difference]: With dead ends: 46 [2018-11-07 22:03:01,123 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 22:03:01,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:03:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 22:03:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-07 22:03:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 22:03:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-07 22:03:01,130 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2018-11-07 22:03:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:01,130 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-07 22:03:01,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:03:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-07 22:03:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 22:03:01,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:01,132 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:01,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:01,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash -227970393, now seen corresponding path program 3 times [2018-11-07 22:03:01,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:01,293 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:01,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:01,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,293 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 22:03:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:01,313 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:01,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:01,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:01,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:01,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-07 22:03:01,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:01,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:03:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:03:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:03:01,577 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 7 states. [2018-11-07 22:03:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:01,649 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-07 22:03:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:03:01,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-07 22:03:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:01,654 INFO L225 Difference]: With dead ends: 52 [2018-11-07 22:03:01,654 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 22:03:01,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:03:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 22:03:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-07 22:03:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 22:03:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-07 22:03:01,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2018-11-07 22:03:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:01,662 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-07 22:03:01,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:03:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-07 22:03:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 22:03:01,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:01,664 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:01,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:01,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 223280591, now seen corresponding path program 4 times [2018-11-07 22:03:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:02,004 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:02,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:02,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,005 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 22:03:02,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:02,024 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:02,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:03:02,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:03:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:03:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:02,318 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 8 states. [2018-11-07 22:03:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:02,454 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-07 22:03:02,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:03:02,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-07 22:03:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:02,455 INFO L225 Difference]: With dead ends: 58 [2018-11-07 22:03:02,455 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 22:03:02,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 22:03:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-07 22:03:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 22:03:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-07 22:03:02,464 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 40 [2018-11-07 22:03:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:02,465 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-07 22:03:02,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:03:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-07 22:03:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 22:03:02,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:02,466 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:02,467 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:02,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -291927305, now seen corresponding path program 5 times [2018-11-07 22:03:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,591 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:02,591 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:02,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:02,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,592 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 22:03:02,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:02,609 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:02,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:03:02,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:02,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 22:03:02,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:03:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:03:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:03:02,909 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2018-11-07 22:03:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:03,015 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-07 22:03:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:03:03,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-07 22:03:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:03,017 INFO L225 Difference]: With dead ends: 64 [2018-11-07 22:03:03,017 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 22:03:03,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:03:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 22:03:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-07 22:03:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 22:03:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-07 22:03:03,025 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 46 [2018-11-07 22:03:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:03,025 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-07 22:03:03,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:03:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-07 22:03:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 22:03:03,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:03,028 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:03,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:03,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1124047391, now seen corresponding path program 6 times [2018-11-07 22:03:03,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:03,357 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 22:03:03,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:03,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:03,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:03,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,359 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 22:03:03,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:03,370 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:03,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:03,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:03,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:03,529 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 22:03:03,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:03,959 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 22:03:03,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:03,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 22:03:03,979 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:03,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:03:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:03:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:03:03,981 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 10 states. [2018-11-07 22:03:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:04,187 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-07 22:03:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:03:04,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-07 22:03:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:04,190 INFO L225 Difference]: With dead ends: 70 [2018-11-07 22:03:04,190 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 22:03:04,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:03:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 22:03:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-11-07 22:03:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:03:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-07 22:03:04,197 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 52 [2018-11-07 22:03:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:04,198 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-07 22:03:04,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:03:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-07 22:03:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 22:03:04,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:04,199 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:04,200 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:04,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash -195581113, now seen corresponding path program 7 times [2018-11-07 22:03:04,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:04,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:04,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:04,409 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:04,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:04,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,409 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 22:03:04,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:04,418 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:04,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:04,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 22:03:04,714 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:04,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:03:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:03:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:04,715 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-11-07 22:03:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:04,791 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-07 22:03:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:03:04,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-07 22:03:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:04,794 INFO L225 Difference]: With dead ends: 76 [2018-11-07 22:03:04,794 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:03:04,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:03:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-07 22:03:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 22:03:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-07 22:03:04,802 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 58 [2018-11-07 22:03:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:04,803 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-07 22:03:04,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:03:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-07 22:03:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 22:03:04,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:04,804 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:04,805 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:04,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash -778551697, now seen corresponding path program 8 times [2018-11-07 22:03:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:04,962 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:04,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:04,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,962 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 22:03:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:04,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:05,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:03:05,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:05,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:05,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 22:03:05,292 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:05,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:03:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:03:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:03:05,294 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 12 states. [2018-11-07 22:03:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:05,426 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-07 22:03:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:03:05,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-11-07 22:03:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:05,427 INFO L225 Difference]: With dead ends: 82 [2018-11-07 22:03:05,427 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 22:03:05,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:03:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 22:03:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-11-07 22:03:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 22:03:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-07 22:03:05,438 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 64 [2018-11-07 22:03:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:05,439 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-07 22:03:05,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:03:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-07 22:03:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 22:03:05,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:05,441 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:05,441 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:05,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:05,441 INFO L82 PathProgramCache]: Analyzing trace with hash 920114071, now seen corresponding path program 9 times [2018-11-07 22:03:05,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:05,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:05,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:05,639 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:05,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:05,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,640 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 22:03:05,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:05,648 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:05,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:05,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:05,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-07 22:03:06,019 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:06,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:03:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:03:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:03:06,021 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 13 states. [2018-11-07 22:03:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:06,132 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-07 22:03:06,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:03:06,132 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-11-07 22:03:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:06,134 INFO L225 Difference]: With dead ends: 88 [2018-11-07 22:03:06,134 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 22:03:06,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:03:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 22:03:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-11-07 22:03:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 22:03:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-07 22:03:06,142 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 70 [2018-11-07 22:03:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:06,142 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-07 22:03:06,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:03:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-07 22:03:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-07 22:03:06,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:06,144 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:06,144 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:06,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1253250369, now seen corresponding path program 10 times [2018-11-07 22:03:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:06,300 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:06,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:06,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,301 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 22:03:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:06,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:06,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 22:03:06,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:06,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:03:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:03:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:06,779 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 14 states. [2018-11-07 22:03:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:06,870 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-07 22:03:06,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:03:06,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2018-11-07 22:03:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:06,871 INFO L225 Difference]: With dead ends: 94 [2018-11-07 22:03:06,871 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 22:03:06,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 22:03:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-07 22:03:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 22:03:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-07 22:03:06,877 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 76 [2018-11-07 22:03:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:06,878 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-07 22:03:06,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:03:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-07 22:03:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-07 22:03:06,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:06,880 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:06,880 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:06,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1152515097, now seen corresponding path program 11 times [2018-11-07 22:03:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:07,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:07,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:07,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:07,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:07,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:07,957 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 22:03:07,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:07,968 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:08,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:03:08,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:08,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:08,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 22:03:08,722 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:03:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:03:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:03:08,724 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 15 states. [2018-11-07 22:03:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:08,838 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-07 22:03:08,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:03:08,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-11-07 22:03:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:08,840 INFO L225 Difference]: With dead ends: 100 [2018-11-07 22:03:08,840 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 22:03:08,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:03:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 22:03:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-11-07 22:03:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 22:03:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-07 22:03:08,847 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 82 [2018-11-07 22:03:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:08,847 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-07 22:03:08,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:03:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-07 22:03:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-07 22:03:08,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:08,849 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:08,849 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:08,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1011982095, now seen corresponding path program 12 times [2018-11-07 22:03:08,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:08,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:08,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:08,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:08,851 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:09,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:09,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:09,097 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:09,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:09,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:09,097 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 22:03:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:09,106 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:09,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:09,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:09,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:09,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:09,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:09,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-07 22:03:09,654 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:09,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:03:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:03:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:03:09,656 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 16 states. [2018-11-07 22:03:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:09,830 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-11-07 22:03:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:03:09,831 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2018-11-07 22:03:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:09,832 INFO L225 Difference]: With dead ends: 106 [2018-11-07 22:03:09,832 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 22:03:09,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:03:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 22:03:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-07 22:03:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 22:03:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-07 22:03:09,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 88 [2018-11-07 22:03:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:09,841 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-07 22:03:09,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:03:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-07 22:03:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 22:03:09,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:09,843 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:09,843 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:09,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1492007991, now seen corresponding path program 13 times [2018-11-07 22:03:09,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:09,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:09,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:10,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:10,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:10,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:10,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:10,162 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 22:03:10,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:10,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:10,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:10,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 22:03:10,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:10,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:03:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:03:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:10,871 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 17 states. [2018-11-07 22:03:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:10,976 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-11-07 22:03:10,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:03:10,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2018-11-07 22:03:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:10,978 INFO L225 Difference]: With dead ends: 112 [2018-11-07 22:03:10,978 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 22:03:10,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 22:03:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-11-07 22:03:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-07 22:03:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-07 22:03:10,984 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 94 [2018-11-07 22:03:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:10,984 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-07 22:03:10,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:03:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-07 22:03:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-07 22:03:10,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:10,986 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:10,986 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:10,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 114973535, now seen corresponding path program 14 times [2018-11-07 22:03:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:10,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:11,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:11,209 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:11,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:11,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:11,210 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 22:03:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:11,218 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:11,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 22:03:11,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:11,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:11,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 22:03:11,846 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:11,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:03:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:03:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:03:11,848 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 18 states. [2018-11-07 22:03:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:11,970 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-11-07 22:03:11,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:03:11,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 100 [2018-11-07 22:03:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:11,972 INFO L225 Difference]: With dead ends: 118 [2018-11-07 22:03:11,972 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 22:03:11,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:03:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 22:03:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-11-07 22:03:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 22:03:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-07 22:03:11,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 100 [2018-11-07 22:03:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:11,977 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-07 22:03:11,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:03:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-07 22:03:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 22:03:11,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:11,979 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:11,979 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:11,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1192461177, now seen corresponding path program 15 times [2018-11-07 22:03:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:11,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:11,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:12,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:12,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:12,295 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:12,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:12,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:12,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:03:12,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:12,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:12,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:12,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:12,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:12,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:13,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:13,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-07 22:03:13,589 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:13,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:03:13,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:03:13,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:03:13,590 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 19 states. [2018-11-07 22:03:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:13,692 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-11-07 22:03:13,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:03:13,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2018-11-07 22:03:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:13,694 INFO L225 Difference]: With dead ends: 124 [2018-11-07 22:03:13,694 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 22:03:13,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:03:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 22:03:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-11-07 22:03:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 22:03:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-11-07 22:03:13,700 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 106 [2018-11-07 22:03:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:13,700 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-11-07 22:03:13,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:03:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-11-07 22:03:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 22:03:13,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:13,702 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:13,702 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:13,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash 119218095, now seen corresponding path program 16 times [2018-11-07 22:03:13,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:13,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:13,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:14,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:14,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:14,514 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:14,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:14,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:14,514 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 22:03:14,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:14,523 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:14,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:14,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:15,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:15,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 22:03:15,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:15,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:03:15,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:03:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:15,452 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 20 states. [2018-11-07 22:03:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:15,622 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-11-07 22:03:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:03:15,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2018-11-07 22:03:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:15,624 INFO L225 Difference]: With dead ends: 130 [2018-11-07 22:03:15,624 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 22:03:15,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 22:03:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-11-07 22:03:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 22:03:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-11-07 22:03:15,629 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 112 [2018-11-07 22:03:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:15,629 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-11-07 22:03:15,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:03:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-11-07 22:03:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 22:03:15,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:15,630 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:15,631 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1451017431, now seen corresponding path program 17 times [2018-11-07 22:03:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:15,632 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:15,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:15,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:15,918 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:15,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:15,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:15,918 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 22:03:15,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:15,927 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:16,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 22:03:16,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:16,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:16,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:16,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:16,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 22:03:16,745 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:16,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:03:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:03:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:16,746 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 21 states. [2018-11-07 22:03:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:16,872 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-11-07 22:03:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:03:16,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 118 [2018-11-07 22:03:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:16,874 INFO L225 Difference]: With dead ends: 136 [2018-11-07 22:03:16,874 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 22:03:16,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 22:03:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-11-07 22:03:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 22:03:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-11-07 22:03:16,879 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 118 [2018-11-07 22:03:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:16,880 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-11-07 22:03:16,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:03:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-11-07 22:03:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 22:03:16,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:16,881 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:16,882 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2125992961, now seen corresponding path program 18 times [2018-11-07 22:03:16,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:16,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:16,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:16,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:16,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:17,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:17,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:17,228 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:17,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:17,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:17,229 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 22:03:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:17,237 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:18,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:18,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:18,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:18,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:18,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:18,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-07 22:03:18,882 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:18,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:03:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:03:18,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:03:18,884 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 22 states. [2018-11-07 22:03:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:19,034 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-11-07 22:03:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:03:19,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 124 [2018-11-07 22:03:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:19,035 INFO L225 Difference]: With dead ends: 142 [2018-11-07 22:03:19,036 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 22:03:19,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:03:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 22:03:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-11-07 22:03:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 22:03:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-11-07 22:03:19,041 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 124 [2018-11-07 22:03:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:19,042 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-11-07 22:03:19,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:03:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-11-07 22:03:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 22:03:19,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:19,043 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:19,043 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:19,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2127762727, now seen corresponding path program 19 times [2018-11-07 22:03:19,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:19,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:19,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:19,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:19,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:19,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:19,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:19,643 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:19,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:19,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:19,643 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 22:03:19,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:19,653 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:19,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:19,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:20,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 22:03:20,292 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:20,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:03:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:03:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:20,294 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 23 states. [2018-11-07 22:03:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:20,413 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-11-07 22:03:20,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:03:20,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-11-07 22:03:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:20,415 INFO L225 Difference]: With dead ends: 148 [2018-11-07 22:03:20,415 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 22:03:20,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 22:03:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-11-07 22:03:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-07 22:03:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-11-07 22:03:20,422 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 130 [2018-11-07 22:03:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:20,422 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-11-07 22:03:20,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:03:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-11-07 22:03:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 22:03:20,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:20,423 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:20,424 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:20,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:20,424 INFO L82 PathProgramCache]: Analyzing trace with hash 194297935, now seen corresponding path program 20 times [2018-11-07 22:03:20,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:20,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:20,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:20,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:20,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:20,728 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:20,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:20,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:20,728 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 22:03:20,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:20,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:21,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 22:03:21,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:21,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:21,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:22,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:22,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 22:03:22,071 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:22,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:03:22,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:03:22,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:03:22,073 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 24 states. [2018-11-07 22:03:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:22,255 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-11-07 22:03:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:03:22,255 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-11-07 22:03:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:22,256 INFO L225 Difference]: With dead ends: 154 [2018-11-07 22:03:22,256 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 22:03:22,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:03:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 22:03:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-11-07 22:03:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-07 22:03:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-11-07 22:03:22,262 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 136 [2018-11-07 22:03:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:22,263 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-11-07 22:03:22,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:03:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-11-07 22:03:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 22:03:22,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:22,264 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:22,264 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:22,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1361276279, now seen corresponding path program 21 times [2018-11-07 22:03:22,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:22,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:22,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:22,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:22,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:22,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:22,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:22,580 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:22,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:22,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:22,580 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 22:03:22,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:22,589 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:22,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:22,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:22,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:23,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:23,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:23,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-07 22:03:23,666 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:23,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:03:23,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:03:23,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:03:23,667 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 25 states. [2018-11-07 22:03:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:23,820 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-11-07 22:03:23,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:03:23,821 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-07 22:03:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:23,822 INFO L225 Difference]: With dead ends: 160 [2018-11-07 22:03:23,823 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 22:03:23,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:03:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 22:03:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-11-07 22:03:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-07 22:03:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-11-07 22:03:23,829 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 142 [2018-11-07 22:03:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:23,829 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-11-07 22:03:23,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:03:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-11-07 22:03:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 22:03:23,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:23,830 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:23,830 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:23,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1909089121, now seen corresponding path program 22 times [2018-11-07 22:03:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:23,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:23,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:24,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:24,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:24,293 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:24,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:24,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:24,294 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 22:03:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:24,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:24,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:24,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 22:03:25,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:25,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:03:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:03:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:25,060 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 26 states. [2018-11-07 22:03:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:25,288 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-11-07 22:03:25,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:03:25,294 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2018-11-07 22:03:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:25,295 INFO L225 Difference]: With dead ends: 166 [2018-11-07 22:03:25,295 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 22:03:25,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 22:03:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-11-07 22:03:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-07 22:03:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-11-07 22:03:25,300 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 148 [2018-11-07 22:03:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:25,301 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-11-07 22:03:25,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:03:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-11-07 22:03:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 22:03:25,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:25,302 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:25,302 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:25,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1096692281, now seen corresponding path program 23 times [2018-11-07 22:03:25,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:25,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:25,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:25,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:25,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:25,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:25,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:25,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:25,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:25,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:25,669 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 22:03:25,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:25,677 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:26,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 22:03:26,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:26,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:26,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 22:03:27,174 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:27,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:03:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:03:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:03:27,176 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 27 states. [2018-11-07 22:03:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:27,383 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-11-07 22:03:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:03:27,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-07 22:03:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:27,385 INFO L225 Difference]: With dead ends: 172 [2018-11-07 22:03:27,385 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 22:03:27,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:03:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 22:03:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-11-07 22:03:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-07 22:03:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-11-07 22:03:27,390 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 154 [2018-11-07 22:03:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:27,391 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-11-07 22:03:27,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:03:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-11-07 22:03:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 22:03:27,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:27,393 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:27,393 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:27,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1130266863, now seen corresponding path program 24 times [2018-11-07 22:03:27,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:27,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:27,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:27,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:27,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:28,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:28,174 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:28,174 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:28,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:28,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:28,174 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 22:03:28,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:28,186 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:28,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:28,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:28,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:28,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:29,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:29,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-07 22:03:29,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:29,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:03:29,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:03:29,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 22:03:29,272 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 28 states. [2018-11-07 22:03:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:29,463 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-11-07 22:03:29,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:03:29,463 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2018-11-07 22:03:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:29,464 INFO L225 Difference]: With dead ends: 178 [2018-11-07 22:03:29,464 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 22:03:29,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 22:03:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 22:03:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-11-07 22:03:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:03:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-11-07 22:03:29,471 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 160 [2018-11-07 22:03:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:29,471 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-11-07 22:03:29,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:03:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-11-07 22:03:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 22:03:29,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:29,473 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:29,473 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:29,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1971177961, now seen corresponding path program 25 times [2018-11-07 22:03:29,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:29,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:29,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:29,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:29,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:29,928 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:29,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:29,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:29,929 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 22:03:29,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:29,937 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:29,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:30,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:31,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:31,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 22:03:31,620 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:31,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:03:31,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:03:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:31,622 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 29 states. [2018-11-07 22:03:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:31,783 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-11-07 22:03:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:03:31,783 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 166 [2018-11-07 22:03:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:31,785 INFO L225 Difference]: With dead ends: 184 [2018-11-07 22:03:31,785 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 22:03:31,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 22:03:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-11-07 22:03:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 22:03:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-11-07 22:03:31,791 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 166 [2018-11-07 22:03:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:31,791 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-11-07 22:03:31,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:03:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-11-07 22:03:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 22:03:31,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:31,793 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:31,793 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:31,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1220317889, now seen corresponding path program 26 times [2018-11-07 22:03:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:31,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:32,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:32,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:32,583 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:32,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:32,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:32,583 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 22:03:32,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:32,594 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:35,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 22:03:35,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:35,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:35,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:36,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:36,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 22:03:36,214 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:36,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:03:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:03:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:03:36,216 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 30 states. [2018-11-07 22:03:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:36,512 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-11-07 22:03:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:03:36,512 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 172 [2018-11-07 22:03:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:36,514 INFO L225 Difference]: With dead ends: 190 [2018-11-07 22:03:36,515 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 22:03:36,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:03:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 22:03:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-11-07 22:03:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-07 22:03:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-11-07 22:03:36,522 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 172 [2018-11-07 22:03:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-11-07 22:03:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:03:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-11-07 22:03:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 22:03:36,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:36,523 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:36,524 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1241032295, now seen corresponding path program 27 times [2018-11-07 22:03:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:36,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:36,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:37,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:37,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:37,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:37,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:37,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:37,669 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 22:03:37,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:37,693 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:38,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:38,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:38,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:38,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:40,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:40,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-07 22:03:40,232 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:40,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:03:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:03:40,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:03:40,234 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 31 states. [2018-11-07 22:03:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:40,788 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-11-07 22:03:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:03:40,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 178 [2018-11-07 22:03:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:40,790 INFO L225 Difference]: With dead ends: 196 [2018-11-07 22:03:40,790 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 22:03:40,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:03:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 22:03:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-11-07 22:03:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-07 22:03:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-11-07 22:03:40,798 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 178 [2018-11-07 22:03:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:40,799 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-11-07 22:03:40,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:03:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-11-07 22:03:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 22:03:40,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:40,802 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:40,802 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:40,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash -937926257, now seen corresponding path program 28 times [2018-11-07 22:03:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:40,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:40,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:43,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:43,696 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:43,696 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:43,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:43,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:43,696 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 22:03:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:43,704 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:43,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:43,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:44,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 22:03:44,804 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:44,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:03:44,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:03:44,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:44,806 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 32 states. [2018-11-07 22:03:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:45,222 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-11-07 22:03:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:03:45,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 184 [2018-11-07 22:03:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:45,224 INFO L225 Difference]: With dead ends: 202 [2018-11-07 22:03:45,224 INFO L226 Difference]: Without dead ends: 195 [2018-11-07 22:03:45,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-07 22:03:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-11-07 22:03:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 22:03:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-11-07 22:03:45,235 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 184 [2018-11-07 22:03:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:45,235 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-11-07 22:03:45,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:03:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-11-07 22:03:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 22:03:45,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:45,237 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:45,237 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:45,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1681465015, now seen corresponding path program 29 times [2018-11-07 22:03:45,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:45,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:45,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:45,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:45,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:46,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:46,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:46,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:46,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:46,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:46,304 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 22:03:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:46,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:50,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 22:03:50,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:50,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:50,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:52,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:52,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 22:03:52,110 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:52,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:03:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:03:52,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:03:52,111 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 33 states. [2018-11-07 22:03:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:52,277 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-11-07 22:03:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:03:52,278 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 190 [2018-11-07 22:03:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:52,280 INFO L225 Difference]: With dead ends: 208 [2018-11-07 22:03:52,280 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 22:03:52,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:03:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 22:03:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-11-07 22:03:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-07 22:03:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-11-07 22:03:52,287 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 190 [2018-11-07 22:03:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:52,288 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-11-07 22:03:52,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:03:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-11-07 22:03:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-07 22:03:52,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:52,289 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:52,290 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:52,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1508811297, now seen corresponding path program 30 times [2018-11-07 22:03:52,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:52,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:52,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:53,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:53,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:53,888 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:53,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:53,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:53,888 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 22:03:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:53,897 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:54,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:54,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:54,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:54,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:55,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:55,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-07 22:03:55,329 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:55,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:03:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:03:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 22:03:55,330 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 34 states. [2018-11-07 22:03:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:55,552 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-11-07 22:03:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:03:55,553 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 196 [2018-11-07 22:03:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:55,554 INFO L225 Difference]: With dead ends: 214 [2018-11-07 22:03:55,554 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 22:03:55,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 22:03:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 22:03:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-07 22:03:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-07 22:03:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-11-07 22:03:55,560 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 196 [2018-11-07 22:03:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:55,560 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-11-07 22:03:55,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:03:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-11-07 22:03:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 22:03:55,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:55,562 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:55,562 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:55,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 309829383, now seen corresponding path program 31 times [2018-11-07 22:03:55,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:55,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:55,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:56,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:56,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:56,141 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:56,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:56,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:56,142 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 22:03:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:56,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:56,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:56,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:57,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:57,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 22:03:57,549 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:57,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:03:57,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:03:57,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:03:57,550 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 35 states. [2018-11-07 22:03:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:58,207 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-11-07 22:03:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:03:58,208 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2018-11-07 22:03:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:58,211 INFO L225 Difference]: With dead ends: 220 [2018-11-07 22:03:58,211 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 22:03:58,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:03:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 22:03:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2018-11-07 22:03:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-07 22:03:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-11-07 22:03:58,216 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 202 [2018-11-07 22:03:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:58,217 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-11-07 22:03:58,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:03:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-11-07 22:03:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-07 22:03:58,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:58,218 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:58,218 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:58,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash -748527057, now seen corresponding path program 32 times [2018-11-07 22:03:58,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:58,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:58,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:59,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:59,024 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:59,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:59,024 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 22:03:59,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:59,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:05,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 22:04:05,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:05,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:05,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:06,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 22:04:06,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:06,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:04:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:04:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:04:06,779 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 36 states. [2018-11-07 22:04:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:07,020 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-11-07 22:04:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:04:07,020 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 208 [2018-11-07 22:04:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:07,021 INFO L225 Difference]: With dead ends: 226 [2018-11-07 22:04:07,021 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 22:04:07,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:04:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 22:04:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-11-07 22:04:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-07 22:04:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-11-07 22:04:07,027 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 208 [2018-11-07 22:04:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:07,027 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-11-07 22:04:07,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:04:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-11-07 22:04:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 22:04:07,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:07,029 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:07,029 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:07,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1609049943, now seen corresponding path program 33 times [2018-11-07 22:04:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:07,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:07,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:07,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:09,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:09,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:09,158 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:09,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:09,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:09,158 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 22:04:09,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:09,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:11,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:11,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:11,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:11,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:12,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-11-07 22:04:12,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:04:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:04:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 22:04:12,310 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 37 states. [2018-11-07 22:04:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:12,558 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-11-07 22:04:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 22:04:12,558 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 214 [2018-11-07 22:04:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:12,560 INFO L225 Difference]: With dead ends: 232 [2018-11-07 22:04:12,560 INFO L226 Difference]: Without dead ends: 225 [2018-11-07 22:04:12,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 22:04:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-07 22:04:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2018-11-07 22:04:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 22:04:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-11-07 22:04:12,567 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 214 [2018-11-07 22:04:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:12,567 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-11-07 22:04:12,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:04:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-11-07 22:04:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 22:04:12,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:12,569 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:12,569 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:12,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash 608136831, now seen corresponding path program 34 times [2018-11-07 22:04:12,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:12,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:12,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:12,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:12,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:13,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:13,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:13,268 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:13,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:13,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:13,268 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:13,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:13,276 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:13,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:13,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:15,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 22:04:15,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:04:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:04:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:15,108 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 38 states. [2018-11-07 22:04:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:15,344 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-11-07 22:04:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:04:15,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 220 [2018-11-07 22:04:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:15,346 INFO L225 Difference]: With dead ends: 238 [2018-11-07 22:04:15,346 INFO L226 Difference]: Without dead ends: 231 [2018-11-07 22:04:15,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-07 22:04:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2018-11-07 22:04:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 22:04:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-11-07 22:04:15,352 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 220 [2018-11-07 22:04:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:15,353 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-11-07 22:04:15,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:04:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-11-07 22:04:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 22:04:15,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:15,355 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:15,355 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:15,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 700364711, now seen corresponding path program 35 times [2018-11-07 22:04:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:15,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:15,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:16,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:16,017 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:16,017 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:16,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:16,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:16,017 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:16,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:16,026 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:26,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 22:04:26,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:26,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:26,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:27,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 22:04:28,000 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:28,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:04:28,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:04:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:04:28,001 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 39 states. [2018-11-07 22:04:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:28,243 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-11-07 22:04:28,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:04:28,244 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 226 [2018-11-07 22:04:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:28,246 INFO L225 Difference]: With dead ends: 244 [2018-11-07 22:04:28,246 INFO L226 Difference]: Without dead ends: 237 [2018-11-07 22:04:28,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:04:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-07 22:04:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-11-07 22:04:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-07 22:04:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-11-07 22:04:28,250 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 226 [2018-11-07 22:04:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:28,250 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-11-07 22:04:28,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:04:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-11-07 22:04:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-07 22:04:28,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:28,252 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:28,252 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:28,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1092844849, now seen corresponding path program 36 times [2018-11-07 22:04:28,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:28,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:28,253 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:28,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:28,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:28,986 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:28,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:28,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:28,986 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:28,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:28,994 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:30,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:30,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:30,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:30,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:32,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-07 22:04:32,366 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:32,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:04:32,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:04:32,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:04:32,367 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 40 states. [2018-11-07 22:04:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:32,605 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-11-07 22:04:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:04:32,605 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 232 [2018-11-07 22:04:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:32,608 INFO L225 Difference]: With dead ends: 250 [2018-11-07 22:04:32,608 INFO L226 Difference]: Without dead ends: 243 [2018-11-07 22:04:32,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:04:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-07 22:04:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-11-07 22:04:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-07 22:04:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-11-07 22:04:32,613 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 232 [2018-11-07 22:04:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:32,613 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-11-07 22:04:32,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:04:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-11-07 22:04:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-07 22:04:32,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:32,615 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:32,615 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:32,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash 523194359, now seen corresponding path program 37 times [2018-11-07 22:04:32,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:32,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:32,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:33,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:33,657 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:33,657 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:33,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:33,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:33,658 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:33,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:33,666 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:33,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:33,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:36,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 22:04:36,202 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:04:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:04:36,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:36,203 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 41 states. [2018-11-07 22:04:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:36,441 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-11-07 22:04:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:04:36,448 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 238 [2018-11-07 22:04:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:36,449 INFO L225 Difference]: With dead ends: 256 [2018-11-07 22:04:36,450 INFO L226 Difference]: Without dead ends: 249 [2018-11-07 22:04:36,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-07 22:04:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-11-07 22:04:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-07 22:04:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-11-07 22:04:36,455 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 238 [2018-11-07 22:04:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:36,455 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-11-07 22:04:36,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:04:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-11-07 22:04:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-07 22:04:36,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:36,457 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:36,457 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:36,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 460168991, now seen corresponding path program 38 times [2018-11-07 22:04:36,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:36,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:36,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:37,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:37,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:37,225 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:37,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:37,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:37,226 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:37,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:37,235 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:54,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 22:04:54,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:54,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:54,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:56,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 22:04:56,482 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:56,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:04:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:04:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:04:56,483 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 42 states. [2018-11-07 22:04:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:56,747 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-11-07 22:04:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:04:56,747 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 244 [2018-11-07 22:04:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:56,749 INFO L225 Difference]: With dead ends: 262 [2018-11-07 22:04:56,749 INFO L226 Difference]: Without dead ends: 255 [2018-11-07 22:04:56,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:04:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-07 22:04:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2018-11-07 22:04:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 22:04:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-11-07 22:04:56,755 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 244 [2018-11-07 22:04:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:56,756 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-11-07 22:04:56,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:04:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-11-07 22:04:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-07 22:04:56,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:56,758 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:56,758 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:56,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1049759673, now seen corresponding path program 39 times [2018-11-07 22:04:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:56,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:56,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:57,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:57,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:57,577 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:57,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:57,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:57,577 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:04:57,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:57,587 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:58,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:58,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:58,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:58,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:59,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:59,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-11-07 22:04:59,890 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:59,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:04:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:04:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 22:04:59,892 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 43 states. [2018-11-07 22:05:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:00,262 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-11-07 22:05:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 22:05:00,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 250 [2018-11-07 22:05:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:00,264 INFO L225 Difference]: With dead ends: 268 [2018-11-07 22:05:00,264 INFO L226 Difference]: Without dead ends: 261 [2018-11-07 22:05:00,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 22:05:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-07 22:05:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2018-11-07 22:05:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-07 22:05:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-11-07 22:05:00,270 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 250 [2018-11-07 22:05:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:00,271 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-11-07 22:05:00,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:05:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-11-07 22:05:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-07 22:05:00,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:00,272 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:00,273 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:00,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:00,273 INFO L82 PathProgramCache]: Analyzing trace with hash 69649263, now seen corresponding path program 40 times [2018-11-07 22:05:00,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:00,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:00,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:00,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:00,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:01,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:01,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:01,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:01,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:01,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:01,126 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:01,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:01,135 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:05:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:01,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:01,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:03,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:03,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 22:05:03,123 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:03,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:05:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:05:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:05:03,125 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 44 states. [2018-11-07 22:05:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:03,418 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-11-07 22:05:03,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:05:03,418 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 256 [2018-11-07 22:05:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:03,421 INFO L225 Difference]: With dead ends: 274 [2018-11-07 22:05:03,421 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 22:05:03,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:05:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 22:05:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-11-07 22:05:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-07 22:05:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-11-07 22:05:03,427 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 256 [2018-11-07 22:05:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:03,428 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-11-07 22:05:03,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:05:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-11-07 22:05:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-07 22:05:03,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:03,429 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:03,430 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:03,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1672386711, now seen corresponding path program 41 times [2018-11-07 22:05:03,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:03,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:04,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:04,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:04,277 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:04,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:04,278 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:04,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:05:04,286 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:05:40,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 22:05:40,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:40,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:40,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:42,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:42,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 22:05:42,650 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:42,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:05:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:05:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:05:42,651 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 45 states. [2018-11-07 22:05:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:42,914 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-11-07 22:05:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:05:42,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 262 [2018-11-07 22:05:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:42,918 INFO L225 Difference]: With dead ends: 280 [2018-11-07 22:05:42,918 INFO L226 Difference]: Without dead ends: 273 [2018-11-07 22:05:42,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:05:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-07 22:05:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2018-11-07 22:05:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-07 22:05:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-11-07 22:05:42,924 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 262 [2018-11-07 22:05:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:42,925 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-11-07 22:05:42,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:05:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-11-07 22:05:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-07 22:05:42,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:42,927 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:42,927 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:42,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1791234113, now seen corresponding path program 42 times [2018-11-07 22:05:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:42,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:42,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:43,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:43,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:43,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:43,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:43,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:43,831 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:05:43,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:05:49,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:05:49,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:49,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:49,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:52,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-11-07 22:05:52,327 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:52,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:05:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:05:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 22:05:52,329 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 46 states. [2018-11-07 22:05:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:52,595 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-11-07 22:05:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 22:05:52,596 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 268 [2018-11-07 22:05:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:52,597 INFO L225 Difference]: With dead ends: 286 [2018-11-07 22:05:52,597 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 22:05:52,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 22:05:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 22:05:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-11-07 22:05:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-07 22:05:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-11-07 22:05:52,604 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 268 [2018-11-07 22:05:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:52,604 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-11-07 22:05:52,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:05:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-11-07 22:05:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 22:05:52,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:52,606 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:52,607 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:52,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 723863783, now seen corresponding path program 43 times [2018-11-07 22:05:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:52,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:52,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:53,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:53,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:53,557 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:53,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:53,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:53,557 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:53,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:53,567 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:05:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:53,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:53,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:55,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:55,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 22:05:55,861 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:55,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:05:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:05:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:05:55,863 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 47 states. [2018-11-07 22:05:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:56,187 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-11-07 22:05:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:05:56,188 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 274 [2018-11-07 22:05:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:56,190 INFO L225 Difference]: With dead ends: 292 [2018-11-07 22:05:56,190 INFO L226 Difference]: Without dead ends: 285 [2018-11-07 22:05:56,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:05:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-07 22:05:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2018-11-07 22:05:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-07 22:05:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-11-07 22:05:56,200 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 274 [2018-11-07 22:05:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:56,200 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-11-07 22:05:56,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:05:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-11-07 22:05:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 22:05:56,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:56,202 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:56,202 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1021387791, now seen corresponding path program 44 times [2018-11-07 22:05:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:56,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:56,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:57,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:57,809 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:57,809 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:57,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:57,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:57,810 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:57,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:05:57,819 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:41,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 22:06:41,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:41,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:41,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:44,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:44,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 22:06:44,387 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:44,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:06:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:06:44,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:06:44,388 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 48 states. [2018-11-07 22:06:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:44,735 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-11-07 22:06:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:06:44,736 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 280 [2018-11-07 22:06:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:44,738 INFO L225 Difference]: With dead ends: 298 [2018-11-07 22:06:44,738 INFO L226 Difference]: Without dead ends: 291 [2018-11-07 22:06:44,739 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:06:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-07 22:06:44,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-11-07 22:06:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-07 22:06:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-11-07 22:06:44,744 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 280 [2018-11-07 22:06:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:44,744 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-11-07 22:06:44,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:06:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-11-07 22:06:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-07 22:06:44,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:44,746 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:44,747 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:44,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 252051767, now seen corresponding path program 45 times [2018-11-07 22:06:44,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:44,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:44,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:45,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:45,744 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:45,744 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:45,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:45,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:45,744 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:45,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:45,753 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:46,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:46,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:46,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:46,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:48,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:48,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-11-07 22:06:48,846 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:48,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:06:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:06:48,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:06:48,848 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 49 states. [2018-11-07 22:06:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:49,590 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-11-07 22:06:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:06:49,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 286 [2018-11-07 22:06:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:49,592 INFO L225 Difference]: With dead ends: 304 [2018-11-07 22:06:49,592 INFO L226 Difference]: Without dead ends: 297 [2018-11-07 22:06:49,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:06:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-07 22:06:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2018-11-07 22:06:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-07 22:06:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-11-07 22:06:49,601 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 286 [2018-11-07 22:06:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:49,602 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-11-07 22:06:49,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:06:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-11-07 22:06:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-07 22:06:49,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:49,604 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:49,605 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:49,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1152753569, now seen corresponding path program 46 times [2018-11-07 22:06:49,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:49,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:49,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:53,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:53,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:53,043 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:53,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:53,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:53,043 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:53,055 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:53,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:53,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:55,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:55,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 22:06:55,559 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:55,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:06:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:06:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:06:55,561 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 50 states. [2018-11-07 22:06:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:55,876 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-11-07 22:06:55,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:06:55,877 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 292 [2018-11-07 22:06:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:55,878 INFO L225 Difference]: With dead ends: 310 [2018-11-07 22:06:55,878 INFO L226 Difference]: Without dead ends: 303 [2018-11-07 22:06:55,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:06:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-07 22:06:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-11-07 22:06:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-07 22:06:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-11-07 22:06:55,885 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 292 [2018-11-07 22:06:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:55,885 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-11-07 22:06:55,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:06:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-11-07 22:06:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-07 22:06:55,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:55,887 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:55,887 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash -662388345, now seen corresponding path program 47 times [2018-11-07 22:06:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:55,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:55,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:56,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:56,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:56,990 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:56,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:56,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:56,990 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:56,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:56,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown