java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:16:37,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:16:37,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:16:37,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:16:37,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:16:37,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:16:37,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:16:37,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:16:37,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:16:37,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:16:37,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:16:37,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:16:37,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:16:37,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:16:37,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:16:37,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:16:37,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:16:37,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:16:37,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:16:37,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:16:37,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:16:37,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:16:37,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:16:37,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:16:37,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:16:37,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:16:37,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:16:37,726 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:16:37,726 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:16:37,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:16:37,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:16:37,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:16:37,729 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:16:37,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:16:37,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:16:37,731 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:16:37,731 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:16:37,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:16:37,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:16:37,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:16:37,748 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:16:37,748 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:16:37,748 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:16:37,749 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:16:37,749 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:16:37,749 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:16:37,749 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:16:37,749 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:16:37,749 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:16:37,750 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:16:37,750 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:16:37,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:16:37,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:16:37,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:16:37,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:16:37,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:16:37,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:16:37,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:16:37,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:16:37,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:16:37,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:16:37,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:16:37,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:16:37,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:16:37,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:16:37,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:16:37,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:16:37,755 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:16:37,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:16:37,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:16:37,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:16:37,756 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:16:37,756 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:16:37,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:16:37,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:16:37,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:16:37,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:16:37,849 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:16:37,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-10-27 09:16:37,924 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ec8e4b2d2/cdc6472f2b4444efa5208c8557d8226b/FLAG968218636 [2018-10-27 09:16:38,392 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:16:38,392 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-10-27 09:16:38,399 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ec8e4b2d2/cdc6472f2b4444efa5208c8557d8226b/FLAG968218636 [2018-10-27 09:16:38,414 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ec8e4b2d2/cdc6472f2b4444efa5208c8557d8226b [2018-10-27 09:16:38,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:16:38,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:16:38,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:16:38,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:16:38,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:16:38,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6354d7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38, skipping insertion in model container [2018-10-27 09:16:38,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:16:38,467 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:16:38,645 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:16:38,650 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:16:38,669 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:16:38,685 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:16:38,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38 WrapperNode [2018-10-27 09:16:38,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:16:38,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:16:38,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:16:38,688 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:16:38,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:16:38,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:16:38,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:16:38,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:16:38,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... [2018-10-27 09:16:38,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:16:38,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:16:38,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:16:38,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:16:38,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:16:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:16:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-10-27 09:16:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-10-27 09:16:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:16:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:16:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:16:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:16:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:16:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:16:39,273 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:16:39,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:16:39 BoogieIcfgContainer [2018-10-27 09:16:39,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:16:39,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:16:39,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:16:39,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:16:39,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:16:38" (1/3) ... [2018-10-27 09:16:39,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd702a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:16:39, skipping insertion in model container [2018-10-27 09:16:39,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:16:38" (2/3) ... [2018-10-27 09:16:39,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd702a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:16:39, skipping insertion in model container [2018-10-27 09:16:39,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:16:39" (3/3) ... [2018-10-27 09:16:39,282 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-10-27 09:16:39,291 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:16:39,299 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:16:39,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:16:39,362 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:16:39,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:16:39,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:16:39,363 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:16:39,363 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:16:39,363 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:16:39,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:16:39,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:16:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-27 09:16:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 09:16:39,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:39,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:39,401 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:39,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-10-27 09:16:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:39,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:39,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:39,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:16:39,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:16:39,553 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:39,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:16:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:16:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:16:39,580 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-27 09:16:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:39,606 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-10-27 09:16:39,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:16:39,608 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-27 09:16:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:39,617 INFO L225 Difference]: With dead ends: 44 [2018-10-27 09:16:39,617 INFO L226 Difference]: Without dead ends: 25 [2018-10-27 09:16:39,620 INFO L605 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-10-27 09:16:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-27 09:16:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 09:16:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 09:16:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-10-27 09:16:39,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-10-27 09:16:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:39,661 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 09:16:39,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:16:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-10-27 09:16:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 09:16:39,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:39,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:39,663 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:39,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-10-27 09:16:39,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:39,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:39,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:39,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:16:39,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 09:16:39,759 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:39,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 09:16:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 09:16:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:16:39,761 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-10-27 09:16:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:39,864 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-10-27 09:16:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 09:16:39,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 09:16:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:39,867 INFO L225 Difference]: With dead ends: 46 [2018-10-27 09:16:39,867 INFO L226 Difference]: Without dead ends: 31 [2018-10-27 09:16:39,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:16:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-27 09:16:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-10-27 09:16:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 09:16:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-27 09:16:39,874 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-10-27 09:16:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:39,875 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 09:16:39,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 09:16:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-10-27 09:16:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 09:16:39,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:39,876 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:39,877 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:39,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-10-27 09:16:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:39,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:39,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:39,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:39,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:39,966 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 09:16:39,968 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-27 09:16:40,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:40,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:40,151 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 09:16:40,153 INFO L272 AbstractInterpreter]: Visited 18 different actions 28 times. Merged at 4 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-27 09:16:40,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:40,173 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 09:16:40,242 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 64.12% of their original sizes. [2018-10-27 09:16:40,243 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 09:16:40,306 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-10-27 09:16:40,306 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 09:16:40,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:16:40,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-27 09:16:40,308 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:40,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:16:40,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:16:40,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:16:40,309 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2018-10-27 09:16:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:40,515 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-10-27 09:16:40,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:16:40,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-27 09:16:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:40,518 INFO L225 Difference]: With dead ends: 58 [2018-10-27 09:16:40,518 INFO L226 Difference]: Without dead ends: 41 [2018-10-27 09:16:40,519 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:16:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-27 09:16:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-10-27 09:16:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 09:16:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-10-27 09:16:40,528 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-10-27 09:16:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:40,529 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-27 09:16:40,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:16:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-10-27 09:16:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 09:16:40,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:40,531 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:40,531 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:40,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-10-27 09:16:40,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:40,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:40,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:40,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:40,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:40,595 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:40,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 09:16:40,595 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-27 09:16:40,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:40,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:40,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:16:40,645 INFO L272 AbstractInterpreter]: Visited 23 different actions 33 times. Merged at 4 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-27 09:16:40,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:40,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:16:40,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:40,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:40,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:40,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:40,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:40,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:40,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:40,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-27 09:16:40,979 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:40,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 09:16:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 09:16:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:16:40,980 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 4 states. [2018-10-27 09:16:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:41,114 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2018-10-27 09:16:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 09:16:41,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-27 09:16:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:41,116 INFO L225 Difference]: With dead ends: 66 [2018-10-27 09:16:41,116 INFO L226 Difference]: Without dead ends: 48 [2018-10-27 09:16:41,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:16:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-27 09:16:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-27 09:16:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 09:16:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-10-27 09:16:41,124 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2018-10-27 09:16:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:41,125 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-10-27 09:16:41,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 09:16:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-10-27 09:16:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 09:16:41,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:41,127 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:41,127 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:41,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1808032045, now seen corresponding path program 2 times [2018-10-27 09:16:41,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:41,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:41,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:41,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:41,242 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:41,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:41,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:41,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:41,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:41,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:41,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 09:16:41,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 09:16:42,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 09:16:42,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 8] total 18 [2018-10-27 09:16:42,123 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:42,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:16:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:16:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-10-27 09:16:42,126 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 9 states. [2018-10-27 09:16:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:42,319 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-10-27 09:16:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 09:16:42,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-27 09:16:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:42,321 INFO L225 Difference]: With dead ends: 62 [2018-10-27 09:16:42,321 INFO L226 Difference]: Without dead ends: 60 [2018-10-27 09:16:42,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-10-27 09:16:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-27 09:16:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-27 09:16:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 09:16:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-10-27 09:16:42,333 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 28 [2018-10-27 09:16:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:42,333 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-10-27 09:16:42,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:16:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2018-10-27 09:16:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 09:16:42,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:42,335 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:42,335 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:42,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1809879087, now seen corresponding path program 1 times [2018-10-27 09:16:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:42,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:42,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 09:16:42,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:16:42,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 09:16:42,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:42,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 09:16:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 09:16:42,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 09:16:42,416 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 4 states. [2018-10-27 09:16:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:42,483 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-10-27 09:16:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 09:16:42,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-27 09:16:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:42,488 INFO L225 Difference]: With dead ends: 93 [2018-10-27 09:16:42,488 INFO L226 Difference]: Without dead ends: 72 [2018-10-27 09:16:42,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 09:16:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-27 09:16:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-10-27 09:16:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 09:16:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-10-27 09:16:42,502 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 28 [2018-10-27 09:16:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:42,503 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-10-27 09:16:42,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 09:16:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-10-27 09:16:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 09:16:42,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:42,504 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:42,505 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:42,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-10-27 09:16:42,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:42,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:42,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:42,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:42,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:42,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:42,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:42,576 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 09:16:42,576 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-27 09:16:42,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:42,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:42,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:16:42,656 INFO L272 AbstractInterpreter]: Visited 24 different actions 48 times. Merged at 6 different actions 16 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 8 variables. [2018-10-27 09:16:42,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:42,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:16:42,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:42,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:42,692 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:42,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:42,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:42,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:42,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-27 09:16:42,809 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:42,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:16:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:16:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:16:42,811 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2018-10-27 09:16:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:42,911 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2018-10-27 09:16:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:16:42,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-27 09:16:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:42,914 INFO L225 Difference]: With dead ends: 131 [2018-10-27 09:16:42,915 INFO L226 Difference]: Without dead ends: 92 [2018-10-27 09:16:42,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:16:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-27 09:16:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-10-27 09:16:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 09:16:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-10-27 09:16:42,931 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28 [2018-10-27 09:16:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:42,932 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-10-27 09:16:42,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:16:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-10-27 09:16:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:16:42,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:42,933 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:42,934 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:42,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1153463970, now seen corresponding path program 2 times [2018-10-27 09:16:42,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:42,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:42,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:42,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:42,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:43,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:43,030 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:43,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:43,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:43,041 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:43,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:43,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:43,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 09:16:43,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 09:16:43,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 09:16:43,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 20 [2018-10-27 09:16:43,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:43,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:16:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:16:43,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-10-27 09:16:43,525 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 9 states. [2018-10-27 09:16:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:43,750 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2018-10-27 09:16:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 09:16:43,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-10-27 09:16:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:43,753 INFO L225 Difference]: With dead ends: 94 [2018-10-27 09:16:43,754 INFO L226 Difference]: Without dead ends: 92 [2018-10-27 09:16:43,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:16:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-27 09:16:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-10-27 09:16:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 09:16:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-10-27 09:16:43,766 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 32 [2018-10-27 09:16:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:43,766 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-10-27 09:16:43,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:16:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-10-27 09:16:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:16:43,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:43,768 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:43,768 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:43,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1155311012, now seen corresponding path program 1 times [2018-10-27 09:16:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:43,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:43,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 09:16:43,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:16:43,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 09:16:43,811 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:43,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 09:16:43,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 09:16:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:16:43,812 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 3 states. [2018-10-27 09:16:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:43,851 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-10-27 09:16:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 09:16:43,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-27 09:16:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:43,853 INFO L225 Difference]: With dead ends: 128 [2018-10-27 09:16:43,853 INFO L226 Difference]: Without dead ends: 90 [2018-10-27 09:16:43,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:16:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-27 09:16:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-10-27 09:16:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 09:16:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-10-27 09:16:43,863 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 32 [2018-10-27 09:16:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:43,864 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-10-27 09:16:43,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 09:16:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-10-27 09:16:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:16:43,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:43,865 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:43,865 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:43,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1098052710, now seen corresponding path program 1 times [2018-10-27 09:16:43,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:43,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:43,867 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:43,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:43,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:43,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 09:16:43,940 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-27 09:16:43,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:43,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:43,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:16:43,981 INFO L272 AbstractInterpreter]: Visited 24 different actions 49 times. Merged at 7 different actions 17 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 8 variables. [2018-10-27 09:16:44,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:44,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:16:44,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:44,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:44,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:44,015 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:44,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:44,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:44,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:44,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-27 09:16:44,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:44,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:16:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:16:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:16:44,299 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 6 states. [2018-10-27 09:16:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:44,407 INFO L93 Difference]: Finished difference Result 155 states and 196 transitions. [2018-10-27 09:16:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:16:44,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-10-27 09:16:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:44,409 INFO L225 Difference]: With dead ends: 155 [2018-10-27 09:16:44,409 INFO L226 Difference]: Without dead ends: 108 [2018-10-27 09:16:44,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:16:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-27 09:16:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-10-27 09:16:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 09:16:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2018-10-27 09:16:44,419 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 32 [2018-10-27 09:16:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:44,420 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2018-10-27 09:16:44,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:16:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-10-27 09:16:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 09:16:44,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:44,421 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:44,422 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:44,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1098984993, now seen corresponding path program 2 times [2018-10-27 09:16:44,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:44,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:44,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:44,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:44,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:44,603 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:44,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:44,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:44,604 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:44,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:44,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:44,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:44,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:44,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 09:16:44,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 09:16:44,744 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:16:44,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-10-27 09:16:44,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:16:44,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:16:44,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:16:44,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:16:44,745 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand 5 states. [2018-10-27 09:16:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:44,947 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2018-10-27 09:16:44,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:16:44,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-10-27 09:16:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:44,951 INFO L225 Difference]: With dead ends: 181 [2018-10-27 09:16:44,951 INFO L226 Difference]: Without dead ends: 135 [2018-10-27 09:16:44,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:16:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-27 09:16:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2018-10-27 09:16:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-27 09:16:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-10-27 09:16:44,972 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 36 [2018-10-27 09:16:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:44,973 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-10-27 09:16:44,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:16:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-10-27 09:16:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-27 09:16:44,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:44,974 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:44,974 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:44,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2113546820, now seen corresponding path program 1 times [2018-10-27 09:16:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:44,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:44,976 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 86 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 09:16:45,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:45,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:45,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-10-27 09:16:45,072 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-27 09:16:45,074 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:45,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:45,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:16:45,114 INFO L272 AbstractInterpreter]: Visited 26 different actions 59 times. Merged at 10 different actions 23 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 8 variables. [2018-10-27 09:16:45,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:45,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:16:45,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:45,157 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:45,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:45,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:45,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 84 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-27 09:16:45,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 86 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 09:16:45,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:45,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-10-27 09:16:45,696 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:45,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:16:45,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:16:45,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:16:45,697 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 7 states. [2018-10-27 09:16:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:45,966 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-10-27 09:16:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:16:45,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-10-27 09:16:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:45,968 INFO L225 Difference]: With dead ends: 175 [2018-10-27 09:16:45,968 INFO L226 Difference]: Without dead ends: 122 [2018-10-27 09:16:45,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:16:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-27 09:16:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-10-27 09:16:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-27 09:16:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-10-27 09:16:45,977 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 63 [2018-10-27 09:16:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:45,978 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-10-27 09:16:45,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:16:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-10-27 09:16:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-27 09:16:45,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:45,980 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:45,980 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:45,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash -631971868, now seen corresponding path program 2 times [2018-10-27 09:16:45,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:45,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 126 proven. 50 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 09:16:46,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:46,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:46,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:46,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:46,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:46,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:46,120 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:46,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:46,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:46,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 20 proven. 127 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 09:16:46,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-10-27 09:16:46,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:46,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 22 [2018-10-27 09:16:46,884 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:46,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 09:16:46,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 09:16:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:16:46,886 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 16 states. [2018-10-27 09:16:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:47,465 INFO L93 Difference]: Finished difference Result 270 states and 341 transitions. [2018-10-27 09:16:47,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-27 09:16:47,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-10-27 09:16:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:47,469 INFO L225 Difference]: With dead ends: 270 [2018-10-27 09:16:47,469 INFO L226 Difference]: Without dead ends: 209 [2018-10-27 09:16:47,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 09:16:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-27 09:16:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2018-10-27 09:16:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-27 09:16:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2018-10-27 09:16:47,484 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 71 [2018-10-27 09:16:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:47,484 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2018-10-27 09:16:47,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 09:16:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2018-10-27 09:16:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 09:16:47,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:47,487 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 12, 11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:47,488 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:47,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1550893440, now seen corresponding path program 1 times [2018-10-27 09:16:47,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:47,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:47,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 174 proven. 72 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-27 09:16:47,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:47,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:47,612 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-27 09:16:47,612 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-27 09:16:47,615 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:47,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:47,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:16:47,720 INFO L272 AbstractInterpreter]: Visited 28 different actions 127 times. Merged at 12 different actions 48 times. Widened at 1 different actions 2 times. Found 16 fixpoints after 6 different actions. Largest state had 8 variables. [2018-10-27 09:16:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:47,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:16:47,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:47,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:47,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:47,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:47,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 172 proven. 72 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-27 09:16:47,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 174 proven. 72 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-27 09:16:48,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:48,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-10-27 09:16:48,246 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:48,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:16:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:16:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:16:48,247 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand 9 states. [2018-10-27 09:16:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:48,355 INFO L93 Difference]: Finished difference Result 365 states and 456 transitions. [2018-10-27 09:16:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:16:48,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-10-27 09:16:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:48,362 INFO L225 Difference]: With dead ends: 365 [2018-10-27 09:16:48,362 INFO L226 Difference]: Without dead ends: 227 [2018-10-27 09:16:48,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:16:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-27 09:16:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2018-10-27 09:16:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-27 09:16:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2018-10-27 09:16:48,376 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 79 [2018-10-27 09:16:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:48,376 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2018-10-27 09:16:48,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:16:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2018-10-27 09:16:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 09:16:48,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:48,380 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 13, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:48,380 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:48,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:48,381 INFO L82 PathProgramCache]: Analyzing trace with hash -801878872, now seen corresponding path program 2 times [2018-10-27 09:16:48,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:48,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:48,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:48,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:48,382 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-27 09:16:48,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:48,541 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:48,541 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:48,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:48,541 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:48,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:48,550 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:48,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:48,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:48,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 28 proven. 231 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-10-27 09:16:48,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-10-27 09:16:49,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:49,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2018-10-27 09:16:49,139 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:49,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 09:16:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 09:16:49,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:16:49,141 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand 18 states. [2018-10-27 09:16:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:50,428 INFO L93 Difference]: Finished difference Result 409 states and 513 transitions. [2018-10-27 09:16:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-27 09:16:50,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-10-27 09:16:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:50,433 INFO L225 Difference]: With dead ends: 409 [2018-10-27 09:16:50,433 INFO L226 Difference]: Without dead ends: 263 [2018-10-27 09:16:50,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=2045, Unknown=0, NotChecked=0, Total=2550 [2018-10-27 09:16:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-27 09:16:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 247. [2018-10-27 09:16:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-27 09:16:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2018-10-27 09:16:50,447 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 87 [2018-10-27 09:16:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:50,447 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2018-10-27 09:16:50,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 09:16:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2018-10-27 09:16:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 09:16:50,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:50,449 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 16, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:50,449 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash 220500928, now seen corresponding path program 3 times [2018-10-27 09:16:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:50,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:50,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:50,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 294 proven. 128 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-27 09:16:50,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:50,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:50,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:50,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:50,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:50,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:50,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:16:50,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:16:50,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:16:50,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:50,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 110 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:50,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 56 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:16:51,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:51,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19] total 36 [2018-10-27 09:16:51,131 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:51,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 09:16:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 09:16:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 09:16:51,132 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand 28 states. [2018-10-27 09:16:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:51,938 INFO L93 Difference]: Finished difference Result 572 states and 717 transitions. [2018-10-27 09:16:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 09:16:51,945 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 95 [2018-10-27 09:16:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:51,948 INFO L225 Difference]: With dead ends: 572 [2018-10-27 09:16:51,948 INFO L226 Difference]: Without dead ends: 402 [2018-10-27 09:16:51,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 09:16:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-27 09:16:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 373. [2018-10-27 09:16:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-27 09:16:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 445 transitions. [2018-10-27 09:16:51,973 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 445 transitions. Word has length 95 [2018-10-27 09:16:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:51,973 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 445 transitions. [2018-10-27 09:16:51,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 09:16:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 445 transitions. [2018-10-27 09:16:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 09:16:51,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:51,976 INFO L375 BasicCegarLoop]: trace histogram [20, 18, 18, 17, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:51,976 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -911767712, now seen corresponding path program 4 times [2018-10-27 09:16:51,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:51,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:51,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 366 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-27 09:16:52,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:52,182 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:52,182 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:52,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:52,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:52,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:52,192 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:52,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 364 proven. 162 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-10-27 09:16:52,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 366 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-27 09:16:52,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:52,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-10-27 09:16:52,465 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:52,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 09:16:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 09:16:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:16:52,466 INFO L87 Difference]: Start difference. First operand 373 states and 445 transitions. Second operand 12 states. [2018-10-27 09:16:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:52,587 INFO L93 Difference]: Finished difference Result 729 states and 879 transitions. [2018-10-27 09:16:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 09:16:52,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-10-27 09:16:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:52,591 INFO L225 Difference]: With dead ends: 729 [2018-10-27 09:16:52,591 INFO L226 Difference]: Without dead ends: 448 [2018-10-27 09:16:52,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:16:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-27 09:16:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 409. [2018-10-27 09:16:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-27 09:16:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 490 transitions. [2018-10-27 09:16:52,618 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 490 transitions. Word has length 103 [2018-10-27 09:16:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:52,619 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 490 transitions. [2018-10-27 09:16:52,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 09:16:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 490 transitions. [2018-10-27 09:16:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-27 09:16:52,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:52,621 INFO L375 BasicCegarLoop]: trace histogram [22, 20, 20, 19, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:52,621 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:52,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1728217600, now seen corresponding path program 5 times [2018-10-27 09:16:52,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:52,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:52,624 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 446 proven. 200 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-10-27 09:16:53,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:53,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:53,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:53,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:53,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:53,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:53,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:53,525 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:53,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:53,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:53,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 40 proven. 447 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-10-27 09:16:53,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2018-10-27 09:16:53,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:53,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2018-10-27 09:16:53,926 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:53,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 09:16:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 09:16:53,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-10-27 09:16:53,928 INFO L87 Difference]: Start difference. First operand 409 states and 490 transitions. Second operand 21 states. [2018-10-27 09:16:54,765 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-27 09:16:55,195 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-27 09:16:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:55,735 INFO L93 Difference]: Finished difference Result 968 states and 1173 transitions. [2018-10-27 09:16:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-27 09:16:55,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2018-10-27 09:16:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:55,738 INFO L225 Difference]: With dead ends: 968 [2018-10-27 09:16:55,738 INFO L226 Difference]: Without dead ends: 663 [2018-10-27 09:16:55,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=553, Invalid=1897, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 09:16:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-27 09:16:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 598. [2018-10-27 09:16:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-10-27 09:16:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 720 transitions. [2018-10-27 09:16:55,772 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 720 transitions. Word has length 111 [2018-10-27 09:16:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:55,772 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 720 transitions. [2018-10-27 09:16:55,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 09:16:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 720 transitions. [2018-10-27 09:16:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-27 09:16:55,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:55,774 INFO L375 BasicCegarLoop]: trace histogram [25, 23, 23, 21, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:55,775 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:55,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1425162325, now seen corresponding path program 1 times [2018-10-27 09:16:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:55,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:55,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:16:55,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:55,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 580 proven. 242 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-27 09:16:55,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:55,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:55,937 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-10-27 09:16:55,937 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-27 09:16:55,939 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:16:55,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:16:55,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:16:55,992 INFO L272 AbstractInterpreter]: Visited 27 different actions 70 times. Merged at 11 different actions 27 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 5 different actions. Largest state had 8 variables. [2018-10-27 09:16:56,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:56,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:16:56,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:56,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:56,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:56,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:16:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:56,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 578 proven. 242 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-10-27 09:16:56,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 580 proven. 242 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-27 09:16:56,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:56,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-10-27 09:16:56,322 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:56,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 09:16:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 09:16:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-27 09:16:56,323 INFO L87 Difference]: Start difference. First operand 598 states and 720 transitions. Second operand 14 states. [2018-10-27 09:16:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:16:56,578 INFO L93 Difference]: Finished difference Result 1165 states and 1412 transitions. [2018-10-27 09:16:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 09:16:56,579 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2018-10-27 09:16:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:16:56,583 INFO L225 Difference]: With dead ends: 1165 [2018-10-27 09:16:56,583 INFO L226 Difference]: Without dead ends: 683 [2018-10-27 09:16:56,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-27 09:16:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-10-27 09:16:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 634. [2018-10-27 09:16:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-27 09:16:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 765 transitions. [2018-10-27 09:16:56,615 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 765 transitions. Word has length 123 [2018-10-27 09:16:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:16:56,615 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 765 transitions. [2018-10-27 09:16:56,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 09:16:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 765 transitions. [2018-10-27 09:16:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-27 09:16:56,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:16:56,618 INFO L375 BasicCegarLoop]: trace histogram [26, 24, 24, 22, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:16:56,618 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:16:56,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:16:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1006237892, now seen corresponding path program 2 times [2018-10-27 09:16:56,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:16:56,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:56,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:16:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:16:56,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:16:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:16:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 630 proven. 288 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-27 09:16:57,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:57,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:16:57,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:16:57,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:16:57,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:16:57,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:16:57,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:16:57,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:16:57,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:16:57,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:16:57,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:16:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 48 proven. 631 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-10-27 09:16:57,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:16:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-10-27 09:16:57,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:16:57,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 30 [2018-10-27 09:16:57,479 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:16:57,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 09:16:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 09:16:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2018-10-27 09:16:57,480 INFO L87 Difference]: Start difference. First operand 634 states and 765 transitions. Second operand 23 states. [2018-10-27 09:16:59,799 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-27 09:17:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:17:00,356 INFO L93 Difference]: Finished difference Result 1265 states and 1538 transitions. [2018-10-27 09:17:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-27 09:17:00,357 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-10-27 09:17:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:17:00,360 INFO L225 Difference]: With dead ends: 1265 [2018-10-27 09:17:00,360 INFO L226 Difference]: Without dead ends: 759 [2018-10-27 09:17:00,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1040, Invalid=3930, Unknown=0, NotChecked=0, Total=4970 [2018-10-27 09:17:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-27 09:17:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 623. [2018-10-27 09:17:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-27 09:17:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 749 transitions. [2018-10-27 09:17:00,395 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 749 transitions. Word has length 127 [2018-10-27 09:17:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:17:00,395 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 749 transitions. [2018-10-27 09:17:00,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 09:17:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 749 transitions. [2018-10-27 09:17:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-27 09:17:00,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:17:00,399 INFO L375 BasicCegarLoop]: trace histogram [42, 39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:17:00,399 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:17:00,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:17:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1712707552, now seen corresponding path program 3 times [2018-10-27 09:17:00,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:17:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:17:00,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:17:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:17:00,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:17:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:17:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1468 proven. 338 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-10-27 09:17:00,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:17:00,964 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:17:00,964 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:17:00,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:17:00,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:17:00,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:17:00,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:17:00,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:17:01,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:17:01,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:17:01,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:17:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1464 proven. 338 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-10-27 09:17:01,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:17:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1468 proven. 338 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-10-27 09:17:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:17:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-10-27 09:17:01,664 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:17:01,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 09:17:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 09:17:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-27 09:17:01,666 INFO L87 Difference]: Start difference. First operand 623 states and 749 transitions. Second operand 16 states. [2018-10-27 09:17:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:17:01,807 INFO L93 Difference]: Finished difference Result 1235 states and 1493 transitions. [2018-10-27 09:17:01,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 09:17:01,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 198 [2018-10-27 09:17:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:17:01,813 INFO L225 Difference]: With dead ends: 1235 [2018-10-27 09:17:01,814 INFO L226 Difference]: Without dead ends: 752 [2018-10-27 09:17:01,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-27 09:17:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-10-27 09:17:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 549. [2018-10-27 09:17:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-10-27 09:17:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 664 transitions. [2018-10-27 09:17:01,846 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 664 transitions. Word has length 198 [2018-10-27 09:17:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:17:01,847 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 664 transitions. [2018-10-27 09:17:01,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 09:17:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 664 transitions. [2018-10-27 09:17:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-27 09:17:01,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:17:01,851 INFO L375 BasicCegarLoop]: trace histogram [45, 42, 42, 42, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:17:01,851 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:17:01,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:17:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1061715719, now seen corresponding path program 4 times [2018-10-27 09:17:01,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:17:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:17:01,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:17:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:17:01,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:17:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:17:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1692 proven. 392 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2018-10-27 09:17:02,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:17:02,217 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:17:02,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:17:02,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:17:02,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:17:02,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:17:02,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:17:02,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:17:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:17:02,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:17:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1688 proven. 392 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2018-10-27 09:17:02,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:17:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1692 proven. 392 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2018-10-27 09:17:02,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:17:02,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-10-27 09:17:02,949 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:17:02,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 09:17:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 09:17:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-27 09:17:02,950 INFO L87 Difference]: Start difference. First operand 549 states and 664 transitions. Second operand 17 states. [2018-10-27 09:17:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:17:03,091 INFO L93 Difference]: Finished difference Result 1021 states and 1242 transitions. [2018-10-27 09:17:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 09:17:03,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 210 [2018-10-27 09:17:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:17:03,096 INFO L225 Difference]: With dead ends: 1021 [2018-10-27 09:17:03,096 INFO L226 Difference]: Without dead ends: 624 [2018-10-27 09:17:03,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-27 09:17:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-27 09:17:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 585. [2018-10-27 09:17:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-27 09:17:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 709 transitions. [2018-10-27 09:17:03,128 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 709 transitions. Word has length 210 [2018-10-27 09:17:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:17:03,128 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 709 transitions. [2018-10-27 09:17:03,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 09:17:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 709 transitions. [2018-10-27 09:17:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-27 09:17:03,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:17:03,131 INFO L375 BasicCegarLoop]: trace histogram [48, 45, 45, 45, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:17:03,132 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:17:03,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:17:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1595542674, now seen corresponding path program 5 times [2018-10-27 09:17:03,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:17:03,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:17:03,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:17:03,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:17:03,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:17:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:17:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1932 proven. 450 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2018-10-27 09:17:03,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:17:03,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:17:03,404 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:17:03,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:17:03,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:17:03,404 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:17:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:17:03,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:17:03,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:17:03,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:17:03,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:17:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1998 proven. 1 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [2018-10-27 09:17:03,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:17:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1940 proven. 59 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [2018-10-27 09:17:04,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:17:04,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 9] total 30 [2018-10-27 09:17:04,042 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:17:04,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 09:17:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 09:17:04,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-10-27 09:17:04,044 INFO L87 Difference]: Start difference. First operand 585 states and 709 transitions. Second operand 26 states. [2018-10-27 09:17:05,107 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-27 09:17:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:17:05,431 INFO L93 Difference]: Finished difference Result 1103 states and 1349 transitions. [2018-10-27 09:17:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 09:17:05,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 222 [2018-10-27 09:17:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:17:05,432 INFO L225 Difference]: With dead ends: 1103 [2018-10-27 09:17:05,432 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 09:17:05,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=600, Invalid=1562, Unknown=0, NotChecked=0, Total=2162 [2018-10-27 09:17:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 09:17:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 09:17:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 09:17:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 09:17:05,436 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222 [2018-10-27 09:17:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:17:05,436 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 09:17:05,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 09:17:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 09:17:05,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 09:17:05,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 09:17:05,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:05,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:06,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:06,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:06,042 WARN L179 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 480 DAG size of output: 88 [2018-10-27 09:17:06,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:06,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:17:08,003 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 87 DAG size of output: 18 [2018-10-27 09:17:08,441 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-27 09:17:08,558 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 09:17:08,558 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-27 09:17:08,558 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:17:08,558 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-10-27 09:17:08,559 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-10-27 09:17:08,559 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-10-27 09:17:08,559 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:17:08,559 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~last~0 199999) [2018-10-27 09:17:08,559 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 09:17:08,559 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 09:17:08,559 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (or (and (= main_~b~0 0) (= main_~c~0 0) (= main_~a~0 0)) (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (< 199999 |old(~last~0)|)) [2018-10-27 09:17:08,559 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (< 199999 |old(~last~0)|)) [2018-10-27 09:17:08,559 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-27 09:17:08,559 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-10-27 09:17:08,559 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (or (< 199999 |old(~last~0)|) (<= ~last~0 199999)) [2018-10-27 09:17:08,559 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse0 (= main_~b~0 main_~a~0)) (.cse1 (<= main_~c~0 200000))) (or (and .cse0 .cse1 (<= 1 main_~st~0)) (< 199999 |old(~last~0)|) (and .cse0 .cse1 (<= ~last~0 199999)))) [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-10-27 09:17:08,560 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-10-27 09:17:08,561 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-10-27 09:17:08,561 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-10-27 09:17:08,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:17:08 BoogieIcfgContainer [2018-10-27 09:17:08,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:17:08,571 INFO L168 Benchmark]: Toolchain (without parser) took 30145.30 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 872.0 MB. Max. memory is 7.1 GB. [2018-10-27 09:17:08,572 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:17:08,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:17:08,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:17:08,574 INFO L168 Benchmark]: Boogie Preprocessor took 34.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:17:08,574 INFO L168 Benchmark]: RCFGBuilder took 522.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:17:08,575 INFO L168 Benchmark]: TraceAbstraction took 29296.02 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 400.6 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -368.4 MB). Peak memory consumption was 901.0 MB. Max. memory is 7.1 GB. [2018-10-27 09:17:08,579 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 522.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29296.02 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 400.6 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -368.4 MB). Peak memory consumption was 901.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((b == a && c <= 200000) && 1 <= st) || 199999 < \old(last)) || ((b == a && c <= 200000) && last <= 199999) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((b == 0 && c == 0) && a == 0) || ((b == a && 200000 <= c) && c <= 200000)) || 199999 < \old(last) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 29.2s OverallTime, 23 OverallIterations, 48 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 646 SDtfs, 1090 SDslu, 3993 SDs, 0 SdLazy, 3504 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3685 GetRequests, 3199 SyntacticMatches, 9 SemanticMatches, 477 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.7978260869565218 AbsIntWeakeningRatio, 0.6086956521739131 AbsIntAvgWeakeningVarsNumRemoved, 0.782608695652174 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 692 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 93 PreInvPairs, 264 NumberOfFragments, 80 HoareAnnotationTreeSize, 93 FomulaSimplifications, 59508 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 9 FomulaSimplificationsInter, 424 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3461 NumberOfCodeBlocks, 2973 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5071 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400661 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2250 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 59 InterpolantComputations, 8 PerfectInterpolantSequences, 42768/50566 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...