java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:38:22,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:38:22,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:38:22,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:38:22,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:38:22,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:38:22,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:38:22,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:38:22,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:38:22,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:38:22,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:38:22,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:38:22,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:38:22,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:38:22,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:38:22,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:38:22,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:38:22,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:38:22,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:38:22,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:38:22,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:38:22,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:38:22,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:38:22,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:38:22,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:38:22,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:38:22,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:38:22,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:38:22,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:38:22,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:38:22,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:38:22,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:38:22,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:38:22,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:38:22,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:38:22,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:38:22,545 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:38:22,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:38:22,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:38:22,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:38:22,579 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:38:22,579 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:38:22,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:38:22,579 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:38:22,580 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:38:22,580 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:38:22,580 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:38:22,581 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:38:22,581 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:38:22,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:38:22,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:38:22,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:38:22,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:38:22,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:38:22,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:38:22,584 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:38:22,585 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:38:22,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:38:22,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:38:22,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:38:22,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:38:22,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:38:22,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:38:22,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:38:22,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:38:22,587 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:38:22,588 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:38:22,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:38:22,588 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:38:22,588 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:38:22,588 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:38:22,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:38:22,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:38:22,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:38:22,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:38:22,670 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:38:22,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-07 16:38:22,746 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f317332ed/86908c9cc04244838c09723db1ee1244/FLAG345775507 [2018-11-07 16:38:23,241 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:38:23,241 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-07 16:38:23,248 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f317332ed/86908c9cc04244838c09723db1ee1244/FLAG345775507 [2018-11-07 16:38:23,265 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f317332ed/86908c9cc04244838c09723db1ee1244 [2018-11-07 16:38:23,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:38:23,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:38:23,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:38:23,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:38:23,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:38:23,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23, skipping insertion in model container [2018-11-07 16:38:23,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:38:23,328 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:38:23,556 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:38:23,561 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:38:23,579 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:38:23,595 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:38:23,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23 WrapperNode [2018-11-07 16:38:23,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:38:23,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:38:23,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:38:23,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:38:23,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:38:23,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:38:23,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:38:23,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:38:23,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... [2018-11-07 16:38:23,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:38:23,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:38:23,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:38:23,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:38:23,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:38:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:38:23,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:38:23,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:38:23,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:38:23,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:38:23,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:38:23,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:38:23,803 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:38:24,046 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:38:24,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:24 BoogieIcfgContainer [2018-11-07 16:38:24,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:38:24,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:38:24,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:38:24,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:38:24,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:38:23" (1/3) ... [2018-11-07 16:38:24,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f17d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:24, skipping insertion in model container [2018-11-07 16:38:24,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:38:23" (2/3) ... [2018-11-07 16:38:24,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f17d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:38:24, skipping insertion in model container [2018-11-07 16:38:24,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:38:24" (3/3) ... [2018-11-07 16:38:24,055 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call1.i [2018-11-07 16:38:24,065 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:38:24,073 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:38:24,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:38:24,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:38:24,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:38:24,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:38:24,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:38:24,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:38:24,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:38:24,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:38:24,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:38:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 16:38:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:38:24,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:24,148 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:24,150 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:24,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 16:38:24,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:24,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:24,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:24,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:24,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:38:24,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:38:24,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:38:24,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:38:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:38:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:38:24,278 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 16:38:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:24,297 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 16:38:24,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:38:24,298 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:38:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:24,307 INFO L225 Difference]: With dead ends: 29 [2018-11-07 16:38:24,307 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 16:38:24,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:38:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 16:38:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 16:38:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 16:38:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 16:38:24,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 16:38:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:24,350 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 16:38:24,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:38:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 16:38:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:38:24,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:24,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:24,352 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:24,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 16:38:24,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:24,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:24,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:24,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:38:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:38:24,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:38:24,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:38:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:38:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:38:24,531 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 16:38:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:24,579 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 16:38:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:38:24,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:38:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:24,582 INFO L225 Difference]: With dead ends: 19 [2018-11-07 16:38:24,582 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 16:38:24,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:38:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 16:38:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 16:38:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 16:38:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 16:38:24,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 16:38:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:24,590 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 16:38:24,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:38:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 16:38:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:38:24,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:24,591 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:24,593 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:24,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 16:38:24,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:24,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:24,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:24,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:24,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:24,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:24,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:24,741 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 16:38:24,743 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 16:38:24,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:38:24,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:38:24,876 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:38:25,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:38:25,173 INFO L272 AbstractInterpreter]: Visited 12 different actions 60 times. Merged at 3 different actions 22 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 16:38:25,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:25,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:38:25,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:25,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:25,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:25,239 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:38:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:25,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:25,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:38:25,718 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:38:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:38:25,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:38:25,721 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 16:38:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:25,833 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 16:38:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:38:25,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 16:38:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:25,835 INFO L225 Difference]: With dead ends: 21 [2018-11-07 16:38:25,836 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 16:38:25,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:38:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 16:38:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 16:38:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 16:38:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 16:38:25,846 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 16:38:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:25,846 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 16:38:25,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:38:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 16:38:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:38:25,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:25,849 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:25,849 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:25,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:25,850 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 16:38:25,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:25,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:25,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:25,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:26,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:26,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:26,105 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:26,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:26,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:26,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:26,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:38:26,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:38:26,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:38:26,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:26,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:26,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:26,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:26,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:38:26,535 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:26,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:38:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:38:26,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:38:26,536 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 16:38:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:26,579 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 16:38:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:38:26,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 16:38:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:26,581 INFO L225 Difference]: With dead ends: 23 [2018-11-07 16:38:26,581 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 16:38:26,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:38:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 16:38:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 16:38:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:38:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 16:38:26,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 16:38:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:26,587 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 16:38:26,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:38:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 16:38:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:38:26,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:26,588 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:26,588 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:26,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:26,589 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 16:38:26,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:26,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:26,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:26,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:26,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:26,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:26,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:26,734 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:26,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:26,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:26,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:26,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:38:26,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:38:26,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:38:26,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:26,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:26,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:27,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:27,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:38:27,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:27,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:38:27,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:38:27,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:38:27,056 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 16:38:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:27,095 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 16:38:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:38:27,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 16:38:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:27,097 INFO L225 Difference]: With dead ends: 25 [2018-11-07 16:38:27,097 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 16:38:27,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:38:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 16:38:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 16:38:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 16:38:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 16:38:27,103 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 16:38:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 16:38:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:38:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 16:38:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:38:27,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:27,104 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:27,105 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:27,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 16:38:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:27,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:27,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:27,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:27,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:27,295 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:27,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 16:38:27,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:27,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:27,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:27,306 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:38:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:27,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:27,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:27,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:27,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:38:27,790 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:27,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:38:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:38:27,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:38:27,792 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 16:38:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:27,849 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 16:38:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:38:27,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 16:38:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:27,852 INFO L225 Difference]: With dead ends: 27 [2018-11-07 16:38:27,853 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:38:27,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:38:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:38:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 16:38:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 16:38:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 16:38:27,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 16:38:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:27,859 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 16:38:27,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:38:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 16:38:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:38:27,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:27,860 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:27,860 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:27,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 16:38:27,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:27,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:27,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:28,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:28,018 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:28,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:28,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:28,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:28,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:28,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:38:28,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:38:28,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:38:28,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:28,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:28,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:28,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:28,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 16:38:28,404 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:28,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:38:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:38:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:38:28,406 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 16:38:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:28,470 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 16:38:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:38:28,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 16:38:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:28,471 INFO L225 Difference]: With dead ends: 29 [2018-11-07 16:38:28,472 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 16:38:28,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:38:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 16:38:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 16:38:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 16:38:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 16:38:28,477 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 16:38:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:28,477 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 16:38:28,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:38:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 16:38:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:38:28,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:28,479 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:28,479 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:28,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 16:38:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:28,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:28,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:28,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:28,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:28,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:28,719 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:28,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:28,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:28,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:28,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:38:28,730 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:38:28,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:38:28,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:28,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:28,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:29,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:38:29,118 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:29,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:38:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:38:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:38:29,120 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-07 16:38:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:29,203 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 16:38:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:38:29,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 16:38:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:29,206 INFO L225 Difference]: With dead ends: 31 [2018-11-07 16:38:29,206 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:38:29,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:38:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:38:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 16:38:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:38:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-07 16:38:29,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-07 16:38:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:29,213 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-07 16:38:29,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:38:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-07 16:38:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 16:38:29,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:29,214 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:29,214 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:29,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-07 16:38:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:29,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:29,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:29,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:29,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:29,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:29,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 16:38:29,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:29,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:29,368 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:38:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:29,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:29,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:29,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:29,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:38:29,654 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:29,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:38:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:38:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:38:29,656 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-07 16:38:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:29,906 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 16:38:29,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:38:29,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-07 16:38:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:29,910 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:38:29,911 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 16:38:29,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:38:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 16:38:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 16:38:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 16:38:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-07 16:38:29,916 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-07 16:38:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:29,916 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-07 16:38:29,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:38:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-07 16:38:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 16:38:29,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:29,918 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:29,918 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:29,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-07 16:38:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:29,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:29,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:30,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:30,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:30,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:30,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:30,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:30,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:30,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:38:30,191 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:38:53,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:38:53,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:53,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:53,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:53,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 16:38:53,946 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:53,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:38:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:38:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:38:53,947 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-07 16:38:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:54,040 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 16:38:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:38:54,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-07 16:38:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:54,042 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:38:54,042 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:38:54,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:38:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:38:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 16:38:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 16:38:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 16:38:54,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-07 16:38:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:54,048 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 16:38:54,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:38:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 16:38:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:38:54,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:54,049 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:54,050 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:54,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-07 16:38:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:54,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:54,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:54,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:54,432 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:54,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:54,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:38:54,442 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:38:54,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:38:54,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:54,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:54,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:54,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:54,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:38:54,749 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:54,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:38:54,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:38:54,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:38:54,751 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-07 16:38:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:54,924 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-07 16:38:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:38:54,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-07 16:38:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:54,927 INFO L225 Difference]: With dead ends: 37 [2018-11-07 16:38:54,927 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:38:54,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:38:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:38:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 16:38:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:38:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-07 16:38:54,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-07 16:38:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:54,933 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-07 16:38:54,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:38:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-07 16:38:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:38:54,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:54,935 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:54,935 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:54,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-07 16:38:54,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:54,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:54,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:55,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:55,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:55,138 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:55,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:55,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:55,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:55,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:55,149 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:38:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:55,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:55,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:55,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:55,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:38:55,619 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:55,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:38:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:38:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:38:55,621 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-07 16:38:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:55,735 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 16:38:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:38:55,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-07 16:38:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:55,737 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:38:55,737 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:38:55,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:38:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:38:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 16:38:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 16:38:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-07 16:38:55,743 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-07 16:38:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:55,743 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-07 16:38:55,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:38:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-07 16:38:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:38:55,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:55,745 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:55,745 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:55,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-07 16:38:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:55,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:56,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:56,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:56,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:56,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:56,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:56,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:56,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:38:56,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:12,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:40:12,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:12,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:12,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:37,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:37,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 16:40:37,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:37,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:40:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:40:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=448, Unknown=9, NotChecked=0, Total=650 [2018-11-07 16:40:37,610 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-07 16:40:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:37,807 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-07 16:40:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:40:37,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-07 16:40:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:37,809 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:40:37,809 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 16:40:37,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=193, Invalid=448, Unknown=9, NotChecked=0, Total=650 [2018-11-07 16:40:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 16:40:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 16:40:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:40:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 16:40:37,816 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-07 16:40:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:37,816 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 16:40:37,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:40:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 16:40:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:40:37,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:37,817 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:37,817 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:37,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-07 16:40:37,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:37,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:37,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:38,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:38,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:38,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:38,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:38,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:38,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:38,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:38,209 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:38,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:38,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:38,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:38,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:39,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:40:39,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:39,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:40:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:40:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:40:39,164 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-07 16:40:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:39,333 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 16:40:39,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:40:39,334 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-07 16:40:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:39,335 INFO L225 Difference]: With dead ends: 43 [2018-11-07 16:40:39,335 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 16:40:39,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:40:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 16:40:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 16:40:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:40:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-07 16:40:39,341 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-07 16:40:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:39,341 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-07 16:40:39,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:40:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-07 16:40:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 16:40:39,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:39,342 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:39,343 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:39,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-07 16:40:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:39,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:39,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:39,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:39,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:39,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:39,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:39,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:39,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:39,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:39,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:39,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:39,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:40,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:40:40,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:40,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:40:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:40:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:40:40,644 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-07 16:40:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:40,806 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 16:40:40,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:40:40,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-07 16:40:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:40,808 INFO L225 Difference]: With dead ends: 45 [2018-11-07 16:40:40,808 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:40:40,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:40:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:40:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 16:40:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 16:40:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-07 16:40:40,814 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-07 16:40:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:40,815 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-07 16:40:40,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:40:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-07 16:40:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 16:40:40,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:40,818 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:40,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:40,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-07 16:40:40,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:40,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:41,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:41,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:41,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:41,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:41,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:41,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:41,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:52,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:40:52,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:52,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:52,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:54,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:54,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 35 [2018-11-07 16:40:54,697 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:54,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:40:54,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:40:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:40:54,699 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-07 16:40:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:54,893 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 16:40:54,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:40:54,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 16:40:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:54,895 INFO L225 Difference]: With dead ends: 47 [2018-11-07 16:40:54,895 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:40:54,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:40:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:40:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 16:40:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:40:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 16:40:54,901 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-07 16:40:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:54,901 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 16:40:54,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:40:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 16:40:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:40:54,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:54,902 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:54,902 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:54,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:54,903 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-07 16:40:54,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:54,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:54,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:55,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:55,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:55,222 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:55,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:55,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:55,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:55,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:55,231 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:55,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:55,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:55,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:55,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:55,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:55,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:40:55,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:55,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:40:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:40:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:40:55,871 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-07 16:40:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:56,083 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-07 16:40:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:40:56,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-07 16:40:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:56,084 INFO L225 Difference]: With dead ends: 49 [2018-11-07 16:40:56,084 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 16:40:56,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:40:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 16:40:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 16:40:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:40:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-07 16:40:56,091 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-07 16:40:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:56,091 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-07 16:40:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:40:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-07 16:40:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:40:56,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:56,092 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:56,092 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:56,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-07 16:40:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:56,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:56,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:56,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:56,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:56,430 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:56,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:56,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:56,431 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:56,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:56,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:56,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:56,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:40:57,327 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:57,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:40:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:40:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:40:57,328 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-07 16:40:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:57,688 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 16:40:57,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:40:57,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-07 16:40:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:57,694 INFO L225 Difference]: With dead ends: 51 [2018-11-07 16:40:57,694 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 16:40:57,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:40:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 16:40:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 16:40:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 16:40:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-07 16:40:57,708 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-07 16:40:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:57,708 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-07 16:40:57,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:40:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-07 16:40:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 16:40:57,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:57,709 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:57,709 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-07 16:40:57,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:57,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:57,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:58,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:58,270 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:58,270 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:58,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:58,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:58,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:58,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:58,279 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