java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:44:44,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:44:44,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:44:44,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:44:44,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:44:44,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:44:44,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:44:44,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:44:44,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:44:44,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:44:44,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:44:44,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:44:44,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:44:44,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:44:44,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:44:44,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:44:44,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:44:44,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:44:44,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:44:44,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:44:44,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:44:44,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:44:44,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:44:44,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:44:44,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:44:44,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:44:44,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:44:44,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:44:44,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:44:44,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:44:44,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:44:44,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:44:44,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:44:44,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:44:44,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:44:44,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:44:44,774 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:44:44,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:44:44,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:44:44,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:44:44,801 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:44:44,801 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:44:44,802 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:44:44,802 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:44:44,802 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:44:44,803 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:44:44,803 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:44:44,803 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:44:44,803 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:44:44,803 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:44:44,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:44:44,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:44:44,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:44:44,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:44:44,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:44:44,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:44:44,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:44:44,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:44:44,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:44:44,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:44:44,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:44:44,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:44:44,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:44:44,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:44:44,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:44:44,810 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:44:44,811 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:44:44,811 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:44:44,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:44:44,811 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:44:44,811 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:44:44,812 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:44:44,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:44:44,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:44:44,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:44:44,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:44:44,914 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:44:44,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-12 20:44:44,986 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917e01713/22d0ee64141b49a186456a6d8926fc70/FLAG665c8cfcf [2018-11-12 20:44:45,484 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:44:45,485 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-12 20:44:45,491 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917e01713/22d0ee64141b49a186456a6d8926fc70/FLAG665c8cfcf [2018-11-12 20:44:45,505 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917e01713/22d0ee64141b49a186456a6d8926fc70 [2018-11-12 20:44:45,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:44:45,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:44:45,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:45,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:44:45,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:44:45,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e43ed2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45, skipping insertion in model container [2018-11-12 20:44:45,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:44:45,564 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:44:45,801 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:45,805 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:44:45,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:45,841 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:44:45,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45 WrapperNode [2018-11-12 20:44:45,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:45,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:45,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:44:45,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:44:45,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:45,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:44:45,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:44:45,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:44:45,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... [2018-11-12 20:44:45,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:44:45,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:44:45,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:44:45,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:44:45,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:44:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:44:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:44:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:44:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:44:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:44:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:44:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:44:46,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:44:46,275 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:44:46,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:46 BoogieIcfgContainer [2018-11-12 20:44:46,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:44:46,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:44:46,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:44:46,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:44:46,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:44:45" (1/3) ... [2018-11-12 20:44:46,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1b6373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:46, skipping insertion in model container [2018-11-12 20:44:46,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:45" (2/3) ... [2018-11-12 20:44:46,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1b6373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:46, skipping insertion in model container [2018-11-12 20:44:46,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:46" (3/3) ... [2018-11-12 20:44:46,303 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono3_false-unreach-call1.c [2018-11-12 20:44:46,328 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:44:46,343 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:44:46,368 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:44:46,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:44:46,417 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:44:46,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:44:46,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:44:46,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:44:46,418 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:44:46,418 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:44:46,418 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:44:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-12 20:44:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:44:46,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:46,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:46,465 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:46,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-12 20:44:46,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:46,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:46,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:46,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:44:46,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:46,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:44:46,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:44:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:44:46,622 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-12 20:44:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:46,645 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-12 20:44:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:44:46,647 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:44:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:46,656 INFO L225 Difference]: With dead ends: 31 [2018-11-12 20:44:46,657 INFO L226 Difference]: Without dead ends: 14 [2018-11-12 20:44:46,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:44:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-12 20:44:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-12 20:44:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-12 20:44:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-12 20:44:46,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-12 20:44:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:46,702 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-12 20:44:46,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:44:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-12 20:44:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:44:46,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:46,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:46,704 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:46,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-12 20:44:46,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:46,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:46,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:46,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:46,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:46,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:46,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:44:46,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:46,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:46,847 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-12 20:44:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:46,904 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-12 20:44:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:46,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:44:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:46,905 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:44:46,905 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:44:46,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:44:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-12 20:44:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-12 20:44:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-12 20:44:46,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-12 20:44:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:46,913 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-12 20:44:46,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-12 20:44:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:44:46,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:46,914 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:46,915 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:46,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-12 20:44:46,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:46,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:46,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:47,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:47,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:47,016 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-12 20:44:47,018 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-12 20:44:47,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:47,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:47,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:44:47,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:47,344 INFO L272 AbstractInterpreter]: Visited 14 different actions 78 times. Merged at 5 different actions 38 times. Widened at 1 different actions 4 times. Performed 196 root evaluator evaluations with a maximum evaluation depth of 5. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-12 20:44:47,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:47,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:47,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:47,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:47,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:47,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:47,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:47,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-11-12 20:44:47,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2018-11-12 20:44:48,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:48,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:44:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:44:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:44:48,120 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-11-12 20:44:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:48,197 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-12 20:44:48,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:44:48,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-12 20:44:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:48,199 INFO L225 Difference]: With dead ends: 31 [2018-11-12 20:44:48,199 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:44:48,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:44:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:44:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-12 20:44:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:44:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-12 20:44:48,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-12 20:44:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:48,206 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-12 20:44:48,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:44:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-12 20:44:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:44:48,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:48,207 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:48,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:48,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1005624851, now seen corresponding path program 2 times [2018-11-12 20:44:48,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:48,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:48,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:48,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:48,336 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:48,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:48,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:48,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:48,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:48,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:48,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:48,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:48,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:44:48,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:44:48,671 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:44:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2018-11-12 20:44:48,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:48,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:44:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:44:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:44:48,674 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2018-11-12 20:44:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:48,831 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-12 20:44:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:44:48,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-12 20:44:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:48,832 INFO L225 Difference]: With dead ends: 32 [2018-11-12 20:44:48,833 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:44:48,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:44:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-12 20:44:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:44:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-12 20:44:48,838 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2018-11-12 20:44:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:48,839 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-12 20:44:48,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:44:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-12 20:44:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:44:48,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:48,840 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:48,841 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:48,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:48,841 INFO L82 PathProgramCache]: Analyzing trace with hash -422257669, now seen corresponding path program 1 times [2018-11-12 20:44:48,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:48,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:48,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:49,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:49,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:49,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-12 20:44:49,030 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-12 20:44:49,032 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:49,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:49,037 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:44:49,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:49,178 INFO L272 AbstractInterpreter]: Visited 15 different actions 99 times. Merged at 6 different actions 45 times. Widened at 1 different actions 5 times. Performed 282 root evaluator evaluations with a maximum evaluation depth of 5. Performed 282 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 3 different actions. Largest state had 5 variables. [2018-11-12 20:44:49,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:49,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:49,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:49,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:49,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:49,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:49,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:49,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-12 20:44:49,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:49,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:44:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:44:49,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:49,775 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-12 20:44:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:49,858 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-12 20:44:49,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:44:49,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-12 20:44:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:49,860 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:44:49,861 INFO L226 Difference]: Without dead ends: 29 [2018-11-12 20:44:49,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-12 20:44:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-12 20:44:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:44:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-12 20:44:49,867 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2018-11-12 20:44:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:49,867 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-12 20:44:49,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:44:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-12 20:44:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:44:49,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:49,869 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:49,869 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:49,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -659252443, now seen corresponding path program 2 times [2018-11-12 20:44:49,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:49,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:50,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:50,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:50,038 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:50,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:50,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:50,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:50,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:50,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:50,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:44:50,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:50,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:44:50,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:44:50,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:50,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2018-11-12 20:44:50,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:50,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:44:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:44:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:44:50,299 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 10 states. [2018-11-12 20:44:50,599 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-12 20:44:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:50,977 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-12 20:44:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:44:50,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-12 20:44:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:50,980 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:44:50,980 INFO L226 Difference]: Without dead ends: 51 [2018-11-12 20:44:50,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:44:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-12 20:44:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-11-12 20:44:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:44:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-12 20:44:50,989 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2018-11-12 20:44:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:50,989 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-12 20:44:50,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:44:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-12 20:44:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:44:50,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:50,991 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:50,991 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:50,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1470926709, now seen corresponding path program 3 times [2018-11-12 20:44:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:50,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:50,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:51,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:51,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:51,485 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:51,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:51,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:51,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:51,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:51,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:51,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:51,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:51,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:51,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:52,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:52,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2018-11-12 20:44:52,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:52,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:44:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:44:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:44:52,131 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 11 states. [2018-11-12 20:44:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:52,443 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-12 20:44:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:44:52,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-12 20:44:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:52,446 INFO L225 Difference]: With dead ends: 73 [2018-11-12 20:44:52,447 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:44:52,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:44:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:44:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-12 20:44:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-12 20:44:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-12 20:44:52,455 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 43 [2018-11-12 20:44:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:52,455 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-12 20:44:52,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:44:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-12 20:44:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-12 20:44:52,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:52,458 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:52,458 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:52,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1020521463, now seen corresponding path program 4 times [2018-11-12 20:44:52,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:52,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:52,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:52,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:52,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:52,765 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:52,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:52,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:52,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:52,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:52,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:52,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:44:52,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:44:53,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:53,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 25 [2018-11-12 20:44:53,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:53,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:44:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:44:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:44:53,313 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 14 states. [2018-11-12 20:44:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:53,924 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-11-12 20:44:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:44:53,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-12 20:44:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:53,927 INFO L225 Difference]: With dead ends: 85 [2018-11-12 20:44:53,928 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:44:53,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:44:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:44:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-12 20:44:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-12 20:44:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-12 20:44:53,938 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 55 [2018-11-12 20:44:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-12 20:44:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:44:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-12 20:44:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-12 20:44:53,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:53,941 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:53,941 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:53,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 732260999, now seen corresponding path program 5 times [2018-11-12 20:44:53,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:53,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:54,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:54,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:54,393 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:54,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:54,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:54,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:54,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:54,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:54,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:44:54,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:54,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 129 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-12 20:44:54,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 129 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-12 20:44:54,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:54,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 25 [2018-11-12 20:44:54,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:54,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:44:54,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:44:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:44:54,786 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 21 states. [2018-11-12 20:44:56,760 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-12 20:44:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:56,761 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-11-12 20:44:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:44:56,761 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-12 20:44:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:56,764 INFO L225 Difference]: With dead ends: 115 [2018-11-12 20:44:56,764 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:44:56,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=314, Invalid=616, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:44:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:44:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-11-12 20:44:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-12 20:44:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-12 20:44:56,776 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 67 [2018-11-12 20:44:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:56,777 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-12 20:44:56,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:44:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-12 20:44:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-12 20:44:56,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:56,779 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:56,779 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:56,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -742753001, now seen corresponding path program 6 times [2018-11-12 20:44:56,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:56,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:56,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:56,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:57,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:57,420 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:57,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:57,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:57,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:57,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:57,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:57,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:57,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 184 proven. 528 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:44:58,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 184 proven. 528 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:44:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 20] total 40 [2018-11-12 20:44:59,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:59,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:44:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:44:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:44:59,454 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 22 states. [2018-11-12 20:45:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:01,150 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-11-12 20:45:01,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:45:01,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-12 20:45:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:01,153 INFO L225 Difference]: With dead ends: 125 [2018-11-12 20:45:01,153 INFO L226 Difference]: Without dead ends: 105 [2018-11-12 20:45:01,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:45:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-12 20:45:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-12 20:45:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-12 20:45:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-12 20:45:01,164 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 87 [2018-11-12 20:45:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:01,165 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-12 20:45:01,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:45:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-12 20:45:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 20:45:01,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:01,167 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:01,167 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:01,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1462524863, now seen corresponding path program 7 times [2018-11-12 20:45:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:01,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:01,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:02,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:02,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:02,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:02,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:02,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:02,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:02,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:02,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 228 proven. 820 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:45:02,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 228 proven. 820 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:45:04,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:04,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 48 [2018-11-12 20:45:04,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:04,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:45:04,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:45:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:45:04,111 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 26 states. [2018-11-12 20:45:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:05,682 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-11-12 20:45:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:45:05,684 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-12 20:45:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:05,685 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:45:05,685 INFO L226 Difference]: Without dead ends: 121 [2018-11-12 20:45:05,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:45:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-12 20:45:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-12 20:45:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-12 20:45:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2018-11-12 20:45:05,699 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 103 [2018-11-12 20:45:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:05,699 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2018-11-12 20:45:05,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:45:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-12 20:45:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:45:05,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:05,701 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:05,702 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:05,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash 379316839, now seen corresponding path program 8 times [2018-11-12 20:45:05,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:05,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:05,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:06,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:06,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:06,607 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:06,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:06,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:06,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:06,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:06,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:06,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:45:06,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:06,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 356 proven. 21 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-11-12 20:45:07,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 356 proven. 21 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-11-12 20:45:07,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:07,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 40 [2018-11-12 20:45:07,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:07,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:45:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:45:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1188, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:45:07,334 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 35 states. [2018-11-12 20:45:09,056 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-11-12 20:45:11,671 WARN L179 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:45:16,643 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-12 20:45:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:17,066 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2018-11-12 20:45:17,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:45:17,066 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-11-12 20:45:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:17,068 INFO L225 Difference]: With dead ends: 179 [2018-11-12 20:45:17,068 INFO L226 Difference]: Without dead ends: 159 [2018-11-12 20:45:17,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=708, Invalid=1644, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:45:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-12 20:45:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 144. [2018-11-12 20:45:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-12 20:45:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-11-12 20:45:17,082 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 119 [2018-11-12 20:45:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:17,082 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-11-12 20:45:17,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:45:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-11-12 20:45:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:45:17,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:17,085 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 29, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:17,085 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:17,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1811900639, now seen corresponding path program 9 times [2018-11-12 20:45:17,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:17,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:17,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:17,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 98 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:18,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:18,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:18,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:18,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:18,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:18,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:18,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:18,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:18,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:18,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:18,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 222 proven. 1953 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:45:18,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 222 proven. 1953 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:45:23,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:23,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34, 35] total 69 [2018-11-12 20:45:23,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:23,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:45:23,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:45:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1291, Invalid=3401, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:45:23,167 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 36 states. [2018-11-12 20:45:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:25,648 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2018-11-12 20:45:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:45:25,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-12 20:45:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:25,650 INFO L225 Difference]: With dead ends: 185 [2018-11-12 20:45:25,651 INFO L226 Difference]: Without dead ends: 161 [2018-11-12 20:45:25,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 252 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1291, Invalid=3401, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:45:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-12 20:45:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-11-12 20:45:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-12 20:45:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-11-12 20:45:25,668 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 143 [2018-11-12 20:45:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:25,668 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-11-12 20:45:25,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:45:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-12 20:45:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-12 20:45:25,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:25,671 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 33, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:25,671 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:25,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 426139081, now seen corresponding path program 10 times [2018-11-12 20:45:25,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:25,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:25,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 110 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:26,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:26,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:26,643 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:26,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:26,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:26,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:26,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:26,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:26,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 506 proven. 2211 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-12 20:45:26,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 506 proven. 2211 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-12 20:45:31,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:31,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 37] total 75 [2018-11-12 20:45:31,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:31,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:45:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:45:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:45:31,775 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 40 states. [2018-11-12 20:45:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:34,948 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-11-12 20:45:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:45:34,949 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-12 20:45:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:34,951 INFO L225 Difference]: With dead ends: 201 [2018-11-12 20:45:34,951 INFO L226 Difference]: Without dead ends: 177 [2018-11-12 20:45:34,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:45:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-12 20:45:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-11-12 20:45:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-12 20:45:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2018-11-12 20:45:34,966 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 159 [2018-11-12 20:45:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:34,966 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2018-11-12 20:45:34,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:45:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2018-11-12 20:45:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 20:45:34,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:34,969 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 37, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:34,969 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:34,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2047224719, now seen corresponding path program 11 times [2018-11-12 20:45:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:34,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:34,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 122 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:36,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:36,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:36,162 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:36,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:36,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:36,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:36,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:36,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:38,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:45:38,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:38,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 698 proven. 36 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-11-12 20:45:41,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 698 proven. 35 refuted. 1 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-11-12 20:45:45,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:45,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 9, 9] total 58 [2018-11-12 20:45:45,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:45:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:45:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2724, Unknown=1, NotChecked=0, Total=3306 [2018-11-12 20:45:45,093 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 51 states. [2018-11-12 20:46:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:02,242 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-11-12 20:46:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:46:02,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 175 [2018-11-12 20:46:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:02,245 INFO L225 Difference]: With dead ends: 227 [2018-11-12 20:46:02,246 INFO L226 Difference]: Without dead ends: 203 [2018-11-12 20:46:02,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=632, Invalid=2789, Unknown=1, NotChecked=0, Total=3422 [2018-11-12 20:46:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-12 20:46:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-12 20:46:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-12 20:46:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-11-12 20:46:02,259 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 175 [2018-11-12 20:46:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:02,260 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-11-12 20:46:02,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:46:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-11-12 20:46:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-12 20:46:02,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:02,263 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 42, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:02,263 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:02,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1093808597, now seen corresponding path program 12 times [2018-11-12 20:46:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:02,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:02,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:04,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:04,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:04,761 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:04,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:04,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:04,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:04,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:04,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:04,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:04,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:04,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 812 proven. 3570 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 20:46:05,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 812 proven. 3570 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 20:46:13,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:13,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 45, 46] total 94 [2018-11-12 20:46:13,003 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:13,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-12 20:46:13,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-12 20:46:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=6444, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:46:13,007 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 50 states. [2018-11-12 20:46:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:17,770 INFO L93 Difference]: Finished difference Result 255 states and 265 transitions. [2018-11-12 20:46:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-12 20:46:17,771 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 199 [2018-11-12 20:46:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:17,774 INFO L225 Difference]: With dead ends: 255 [2018-11-12 20:46:17,774 INFO L226 Difference]: Without dead ends: 226 [2018-11-12 20:46:17,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2298, Invalid=6444, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:46:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-12 20:46:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-11-12 20:46:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-12 20:46:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-11-12 20:46:17,792 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 199 [2018-11-12 20:46:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:17,792 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-11-12 20:46:17,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-12 20:46:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-11-12 20:46:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-12 20:46:17,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:17,795 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 48, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:17,795 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:17,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash 17397287, now seen corresponding path program 13 times [2018-11-12 20:46:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:17,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:17,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:19,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:19,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:19,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:19,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:19,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:19,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:19,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:19,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 926 proven. 4656 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 20:46:20,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 926 proven. 4656 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 20:46:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 51, 52] total 106 [2018-11-12 20:46:28,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:28,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-12 20:46:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-12 20:46:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2910, Invalid=8220, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:46:28,872 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 56 states. [2018-11-12 20:46:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:34,623 INFO L93 Difference]: Finished difference Result 279 states and 289 transitions. [2018-11-12 20:46:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-12 20:46:34,623 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 223 [2018-11-12 20:46:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:34,626 INFO L225 Difference]: With dead ends: 279 [2018-11-12 20:46:34,626 INFO L226 Difference]: Without dead ends: 250 [2018-11-12 20:46:34,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2910, Invalid=8220, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:46:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-12 20:46:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-11-12 20:46:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-12 20:46:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 251 transitions. [2018-11-12 20:46:34,643 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 251 transitions. Word has length 223 [2018-11-12 20:46:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:34,644 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 251 transitions. [2018-11-12 20:46:34,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-12 20:46:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 251 transitions. [2018-11-12 20:46:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-12 20:46:34,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:34,646 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 54, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:34,646 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:34,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1542723037, now seen corresponding path program 14 times [2018-11-12 20:46:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:34,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:36,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:36,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:36,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:36,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:36,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:36,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:36,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:36,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:41,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:46:41,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:41,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 1236 proven. 55 refuted. 0 times theorem prover too weak. 5671 trivial. 0 not checked. [2018-11-12 20:46:41,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 1236 proven. 55 refuted. 0 times theorem prover too weak. 5671 trivial. 0 not checked. [2018-11-12 20:46:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:42,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 9, 9] total 76 [2018-11-12 20:46:42,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:42,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-12 20:46:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-12 20:46:42,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=4683, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:46:42,448 INFO L87 Difference]: Start difference. First operand 249 states and 251 transitions. Second operand 69 states. [2018-11-12 20:46:51,845 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2018-11-12 20:46:52,846 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:47:00,241 WARN L179 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:47:05,803 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:47:18,717 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:47:24,197 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-12 20:47:26,759 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-11-12 20:47:39,127 WARN L179 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:47:45,069 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2018-11-12 20:47:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:45,071 INFO L93 Difference]: Finished difference Result 332 states and 350 transitions. [2018-11-12 20:47:45,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-12 20:47:45,071 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-11-12 20:47:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:45,073 INFO L225 Difference]: With dead ends: 332 [2018-11-12 20:47:45,073 INFO L226 Difference]: Without dead ends: 303 [2018-11-12 20:47:45,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 54.1s TimeCoverageRelationStatistics Valid=2100, Invalid=6082, Unknown=8, NotChecked=0, Total=8190 [2018-11-12 20:47:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-12 20:47:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2018-11-12 20:47:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-12 20:47:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2018-11-12 20:47:45,090 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 247 [2018-11-12 20:47:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:45,090 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2018-11-12 20:47:45,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-12 20:47:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2018-11-12 20:47:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-12 20:47:45,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:45,093 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 61, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:45,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:45,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1860249137, now seen corresponding path program 15 times [2018-11-12 20:47:45,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:45,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:45,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:45,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:45,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 200 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:47:47,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:47,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:47,903 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:47,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:47,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:47,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:47:47,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:47:47,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:47:48,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:47:48,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:48,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 956 proven. 8001 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-12 20:47:48,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 956 proven. 8001 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-12 20:48:04,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:04,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 66, 67] total 135 [2018-11-12 20:48:04,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:04,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-12 20:48:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-12 20:48:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=13335, Unknown=0, NotChecked=0, Total=18090 [2018-11-12 20:48:04,800 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 70 states. [2018-11-12 20:48:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:13,418 INFO L93 Difference]: Finished difference Result 337 states and 347 transitions. [2018-11-12 20:48:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:48:13,419 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 279 [2018-11-12 20:48:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:13,421 INFO L225 Difference]: With dead ends: 337 [2018-11-12 20:48:13,421 INFO L226 Difference]: Without dead ends: 305 [2018-11-12 20:48:13,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 492 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4755, Invalid=13335, Unknown=0, NotChecked=0, Total=18090 [2018-11-12 20:48:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-12 20:48:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2018-11-12 20:48:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-12 20:48:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2018-11-12 20:48:13,440 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 279 [2018-11-12 20:48:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:13,441 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2018-11-12 20:48:13,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-12 20:48:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2018-11-12 20:48:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-12 20:48:13,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:13,443 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 67, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:13,443 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:13,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1582860755, now seen corresponding path program 16 times [2018-11-12 20:48:13,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:13,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:13,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 218 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:48:17,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:17,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:17,912 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:17,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:17,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:17,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:48:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:17,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:48:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:18,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 1558 proven. 9045 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-12 20:48:18,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 1558 proven. 9045 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-12 20:48:34,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:34,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 70, 71] total 145 [2018-11-12 20:48:34,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:34,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-11-12 20:48:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-11-12 20:48:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5467, Invalid=15413, Unknown=0, NotChecked=0, Total=20880 [2018-11-12 20:48:34,387 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 76 states. [2018-11-12 20:48:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:43,908 INFO L93 Difference]: Finished difference Result 361 states and 371 transitions. [2018-11-12 20:48:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-12 20:48:43,909 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 303 [2018-11-12 20:48:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:43,911 INFO L225 Difference]: With dead ends: 361 [2018-11-12 20:48:43,911 INFO L226 Difference]: Without dead ends: 329 [2018-11-12 20:48:43,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 536 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=5467, Invalid=15413, Unknown=0, NotChecked=0, Total=20880 [2018-11-12 20:48:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-12 20:48:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2018-11-12 20:48:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-12 20:48:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 330 transitions. [2018-11-12 20:48:43,935 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 330 transitions. Word has length 303 [2018-11-12 20:48:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:43,935 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 330 transitions. [2018-11-12 20:48:43,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-11-12 20:48:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 330 transitions. [2018-11-12 20:48:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-12 20:48:43,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:43,938 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 73, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:43,938 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1773965865, now seen corresponding path program 17 times [2018-11-12 20:48:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:43,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:43,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 236 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:48:48,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:48,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:48,172 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:48,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:48,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:48,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:48:48,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:48:48,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:48:48,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:48:48,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:48,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 1964 proven. 78 refuted. 0 times theorem prover too weak. 10440 trivial. 0 not checked. [2018-11-12 20:48:49,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 1964 proven. 78 refuted. 0 times theorem prover too weak. 10440 trivial. 0 not checked. [2018-11-12 20:48:50,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:50,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 10, 10] total 98 [2018-11-12 20:48:50,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:50,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-12 20:48:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-12 20:48:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=7925, Unknown=0, NotChecked=0, Total=9506 [2018-11-12 20:48:50,130 INFO L87 Difference]: Start difference. First operand 328 states and 330 transitions. Second operand 90 states. Received shutdown request... [2018-11-12 20:49:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-12 20:49:06,107 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:49:06,111 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:49:06,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:49:06 BoogieIcfgContainer [2018-11-12 20:49:06,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:49:06,112 INFO L168 Benchmark]: Toolchain (without parser) took 260594.15 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 892.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.5 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,113 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:49:06,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:49:06,115 INFO L168 Benchmark]: Boogie Preprocessor took 35.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:49:06,115 INFO L168 Benchmark]: RCFGBuilder took 371.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,116 INFO L168 Benchmark]: TraceAbstraction took 259834.69 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 178.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -37.9 MB). Peak memory consumption was 140.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,120 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 321.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.05 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 35.68 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 371.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259834.69 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 178.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -37.9 MB). Peak memory consumption was 140.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (328states) and FLOYD_HOARE automaton (currently 81 states, 90 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 98 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 259.7s OverallTime, 21 OverallIterations, 80 TraceHistogramMax, 147.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 846 SDtfs, 2694 SDslu, 33301 SDs, 0 SdLazy, 93776 SolverSat, 600 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 72.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5924 GetRequests, 4795 SyntacticMatches, 31 SemanticMatches, 1097 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 155.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 74 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 101.9s InterpolantComputationTime, 5247 NumberOfCodeBlocks, 4483 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 7801 ConstructedInterpolants, 0 QuantifiedInterpolants, 10710123 SizeOfPredicates, 26 NumberOfNonLiveVariables, 3345 ConjunctsInSsa, 807 ConjunctsInUnsatCore, 59 InterpolantComputations, 4 PerfectInterpolantSequences, 61350/184362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown