java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gr2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:46:09,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:46:09,977 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:46:09,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:46:09,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:46:09,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:46:09,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:46:09,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:46:09,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:46:09,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:46:09,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:46:09,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:46:09,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:46:09,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:46:10,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:46:10,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:46:10,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:46:10,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:46:10,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:46:10,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:46:10,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:46:10,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:46:10,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:46:10,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:46:10,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:46:10,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:46:10,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:46:10,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:46:10,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:46:10,023 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:46:10,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:46:10,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:46:10,024 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:46:10,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:46:10,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:46:10,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:46:10,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:46:10,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:46:10,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:46:10,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:46:10,051 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:46:10,052 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:46:10,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:46:10,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:46:10,052 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:46:10,052 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:46:10,053 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:46:10,053 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:46:10,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:46:10,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:46:10,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:46:10,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:46:10,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:46:10,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:46:10,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:46:10,055 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:46:10,055 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:46:10,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:46:10,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:46:10,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:46:10,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:46:10,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:46:10,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:46:10,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:46:10,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:46:10,058 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:46:10,058 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:46:10,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:46:10,059 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:46:10,059 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:46:10,060 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:46:10,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:46:10,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:46:10,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:46:10,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:46:10,138 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:46:10,139 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006_true-unreach-call_true-termination.c.i [2018-11-07 16:46:10,195 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86c83296/53c9c659cf2f4ac7817e7e315f249a6a/FLAG5b5a6a704 [2018-11-07 16:46:10,598 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:46:10,598 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006_true-unreach-call_true-termination.c.i [2018-11-07 16:46:10,604 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86c83296/53c9c659cf2f4ac7817e7e315f249a6a/FLAG5b5a6a704 [2018-11-07 16:46:10,618 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86c83296/53c9c659cf2f4ac7817e7e315f249a6a [2018-11-07 16:46:10,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:46:10,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:46:10,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:46:10,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:46:10,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:46:10,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d7a262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10, skipping insertion in model container [2018-11-07 16:46:10,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:46:10,673 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:46:10,888 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:46:10,892 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:46:10,913 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:46:10,931 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:46:10,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10 WrapperNode [2018-11-07 16:46:10,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:46:10,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:46:10,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:46:10,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:46:10,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:46:10,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:46:10,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:46:10,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:46:10,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... [2018-11-07 16:46:10,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:46:10,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:46:10,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:46:10,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:46:10,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:46:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:46:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:46:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:46:11,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:46:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:46:11,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:46:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:46:11,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:46:11,404 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:46:11,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:11 BoogieIcfgContainer [2018-11-07 16:46:11,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:46:11,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:46:11,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:46:11,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:46:11,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:46:10" (1/3) ... [2018-11-07 16:46:11,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6673a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:11, skipping insertion in model container [2018-11-07 16:46:11,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:10" (2/3) ... [2018-11-07 16:46:11,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6673a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:11, skipping insertion in model container [2018-11-07 16:46:11,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:11" (3/3) ... [2018-11-07 16:46:11,431 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006_true-unreach-call_true-termination.c.i [2018-11-07 16:46:11,455 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:46:11,474 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:46:11,491 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:46:11,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:46:11,527 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:46:11,527 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:46:11,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:46:11,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:46:11,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:46:11,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:46:11,528 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:46:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-07 16:46:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:46:11,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:11,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:11,558 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:11,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -859010367, now seen corresponding path program 1 times [2018-11-07 16:46:11,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:11,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:11,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,618 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:11,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:11,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:46:11,676 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:11,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:46:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:46:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:46:11,699 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-07 16:46:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:11,722 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-07 16:46:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:46:11,724 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:46:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:11,733 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:46:11,733 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 16:46:11,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:46:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 16:46:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 16:46:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 16:46:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 16:46:11,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 16:46:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:11,774 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 16:46:11,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:46:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 16:46:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:46:11,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:11,776 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:11,776 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:11,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 220608140, now seen corresponding path program 1 times [2018-11-07 16:46:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:11,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:11,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:46:11,949 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:11,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:46:11,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:46:11,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:46:11,952 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2018-11-07 16:46:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:12,148 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-07 16:46:12,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:46:12,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 16:46:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:12,150 INFO L225 Difference]: With dead ends: 24 [2018-11-07 16:46:12,150 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 16:46:12,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:46:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 16:46:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 16:46:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 16:46:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-07 16:46:12,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2018-11-07 16:46:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:12,158 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-07 16:46:12,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:46:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-07 16:46:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:46:12,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:12,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:12,160 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:12,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 277866442, now seen corresponding path program 1 times [2018-11-07 16:46:12,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:12,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:12,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:12,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:12,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:46:12,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:12,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:46:12,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:46:12,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:46:12,213 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-07 16:46:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:12,251 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-07 16:46:12,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:46:12,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-07 16:46:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:12,254 INFO L225 Difference]: With dead ends: 37 [2018-11-07 16:46:12,254 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 16:46:12,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:46:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 16:46:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-07 16:46:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 16:46:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-07 16:46:12,262 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2018-11-07 16:46:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:12,264 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-07 16:46:12,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:46:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-07 16:46:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:46:12,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:12,266 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:12,266 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:12,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1383636324, now seen corresponding path program 1 times [2018-11-07 16:46:12,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:12,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:46:12,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:12,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:12,352 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 16:46:12,354 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [17], [19], [23], [25], [32], [35], [37], [43], [44], [45], [47] [2018-11-07 16:46:12,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:46:12,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:46:12,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:46:12,646 INFO L272 AbstractInterpreter]: Visited 15 different actions 83 times. Merged at 6 different actions 41 times. Widened at 1 different actions 5 times. Found 10 fixpoints after 3 different actions. Largest state had 5 variables. [2018-11-07 16:46:12,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:12,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:46:12,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:12,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:12,676 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:12,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:46:12,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:46:12,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:12,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:46:12,822 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:12,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:46:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:46:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:46:12,824 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-11-07 16:46:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:12,875 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-07 16:46:12,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:46:12,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-07 16:46:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:12,877 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:46:12,877 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 16:46:12,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:46:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 16:46:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-07 16:46:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:46:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 16:46:12,884 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-07 16:46:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:12,884 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 16:46:12,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:46:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 16:46:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 16:46:12,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:12,886 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:12,886 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:12,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1112171374, now seen corresponding path program 2 times [2018-11-07 16:46:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:46:13,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:13,004 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:13,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,005 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:13,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:13,026 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:13,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 16:46:13,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:13,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:46:13,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:46:13,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:13,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:46:13,450 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:13,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:46:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:46:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:46:13,452 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-11-07 16:46:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:13,731 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-07 16:46:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:46:13,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-07 16:46:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:13,733 INFO L225 Difference]: With dead ends: 54 [2018-11-07 16:46:13,733 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:46:13,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:46:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:46:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-07 16:46:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 16:46:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-07 16:46:13,740 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-11-07 16:46:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:13,741 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-07 16:46:13,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:46:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-07 16:46:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:46:13,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:13,742 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:13,742 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:13,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash 951638316, now seen corresponding path program 3 times [2018-11-07 16:46:13,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:13,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:13,849 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:13,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:13,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:13,864 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:13,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:13,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:13,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:13,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:14,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:14,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:46:14,038 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:14,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:46:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:46:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:46:14,039 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-07 16:46:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:14,177 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-07 16:46:14,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:46:14,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-07 16:46:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:14,178 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:46:14,179 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 16:46:14,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:46:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 16:46:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-07 16:46:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:46:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-07 16:46:14,193 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 33 [2018-11-07 16:46:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:14,194 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-07 16:46:14,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:46:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-07 16:46:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 16:46:14,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:14,195 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:14,196 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:14,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash 150635354, now seen corresponding path program 4 times [2018-11-07 16:46:14,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:14,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:14,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:14,200 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:14,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:14,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:14,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:14,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:14,446 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:14,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:14,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:14,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:46:14,604 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:14,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:46:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:46:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:46:14,605 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-11-07 16:46:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:14,669 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-07 16:46:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:46:14,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-07 16:46:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:14,671 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:46:14,671 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 16:46:14,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:46:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 16:46:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-07 16:46:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:46:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-07 16:46:14,678 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 37 [2018-11-07 16:46:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:14,679 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-07 16:46:14,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:46:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-07 16:46:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:46:14,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:14,680 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:14,681 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:14,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash 786392712, now seen corresponding path program 5 times [2018-11-07 16:46:14,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:14,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:14,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:14,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:14,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:14,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:14,807 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:14,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:14,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:14,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:14,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 16:46:14,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:14,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 79 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:46:14,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 79 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:46:15,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:15,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2018-11-07 16:46:15,056 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:15,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:46:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:46:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:46:15,057 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 12 states. [2018-11-07 16:46:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:15,334 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-07 16:46:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:46:15,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-07 16:46:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:15,337 INFO L225 Difference]: With dead ends: 78 [2018-11-07 16:46:15,337 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 16:46:15,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:46:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 16:46:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-11-07 16:46:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 16:46:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 16:46:15,346 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 41 [2018-11-07 16:46:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:15,346 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 16:46:15,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:46:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 16:46:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 16:46:15,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:15,348 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:15,348 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:15,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash 568630306, now seen corresponding path program 6 times [2018-11-07 16:46:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:15,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:15,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:15,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:15,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:15,545 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:15,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:15,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:15,554 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:15,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:15,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:15,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:15,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:15,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:15,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:46:15,772 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:15,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:46:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:46:15,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:46:15,773 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-07 16:46:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:15,814 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-07 16:46:15,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:46:15,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-11-07 16:46:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:15,820 INFO L225 Difference]: With dead ends: 77 [2018-11-07 16:46:15,820 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 16:46:15,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:46:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 16:46:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-07 16:46:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:46:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 16:46:15,827 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 49 [2018-11-07 16:46:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:15,828 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 16:46:15,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:46:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 16:46:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 16:46:15,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:15,830 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:15,830 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:15,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:15,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1676137904, now seen corresponding path program 7 times [2018-11-07 16:46:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:15,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:15,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:15,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:16,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:16,005 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:16,005 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:16,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:16,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:16,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:16,020 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:16,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:16,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:16,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:16,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:46:16,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:16,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:46:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:46:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:46:16,294 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 10 states. [2018-11-07 16:46:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:16,456 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-07 16:46:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:46:16,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-11-07 16:46:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:16,458 INFO L225 Difference]: With dead ends: 81 [2018-11-07 16:46:16,458 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 16:46:16,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:46:16,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 16:46:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-07 16:46:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 16:46:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-07 16:46:16,466 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 53 [2018-11-07 16:46:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:16,467 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-07 16:46:16,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:46:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-07 16:46:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 16:46:16,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:16,468 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:16,469 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:16,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1738739330, now seen corresponding path program 8 times [2018-11-07 16:46:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:16,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:16,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 136 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:16,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:16,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:16,602 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:16,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:16,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:16,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:16,612 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:16,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 16:46:16,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:16,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 185 proven. 43 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 16:46:16,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 185 proven. 43 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 16:46:17,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:17,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 16 [2018-11-07 16:46:17,011 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:17,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:46:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:46:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:46:17,012 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 16 states. [2018-11-07 16:46:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:17,299 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2018-11-07 16:46:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:46:17,306 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-11-07 16:46:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:17,307 INFO L225 Difference]: With dead ends: 102 [2018-11-07 16:46:17,307 INFO L226 Difference]: Without dead ends: 80 [2018-11-07 16:46:17,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=565, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:46:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-07 16:46:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-11-07 16:46:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 16:46:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-11-07 16:46:17,316 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 57 [2018-11-07 16:46:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:17,316 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-07 16:46:17,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:46:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-07 16:46:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:46:17,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:17,318 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:17,318 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:17,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 626237464, now seen corresponding path program 9 times [2018-11-07 16:46:17,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:17,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:17,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 171 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:17,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:17,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:17,484 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:17,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:17,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:17,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:17,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:17,499 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:17,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:17,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:17,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 171 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:17,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 171 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:18,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:46:18,186 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:18,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:46:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:46:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:46:18,187 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 12 states. [2018-11-07 16:46:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:18,238 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-11-07 16:46:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:46:18,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-07 16:46:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:18,241 INFO L225 Difference]: With dead ends: 97 [2018-11-07 16:46:18,241 INFO L226 Difference]: Without dead ends: 71 [2018-11-07 16:46:18,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:46:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-07 16:46:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-07 16:46:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 16:46:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-11-07 16:46:18,257 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 65 [2018-11-07 16:46:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:18,257 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-11-07 16:46:18,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:46:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-07 16:46:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 16:46:18,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:18,262 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:18,262 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:18,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1859055034, now seen corresponding path program 10 times [2018-11-07 16:46:18,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:18,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:18,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:18,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:18,536 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:18,536 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:18,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:18,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:18,536 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:18,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:18,547 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:18,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:18,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:18,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:18,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:46:18,899 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:18,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:46:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:46:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:18,901 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 13 states. [2018-11-07 16:46:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:18,952 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-11-07 16:46:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:46:18,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-07 16:46:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:18,953 INFO L225 Difference]: With dead ends: 101 [2018-11-07 16:46:18,954 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 16:46:18,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 16:46:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-07 16:46:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 16:46:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-07 16:46:18,963 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 69 [2018-11-07 16:46:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:18,964 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-07 16:46:18,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:46:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-07 16:46:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-07 16:46:18,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:18,966 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:18,966 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:18,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 260947316, now seen corresponding path program 11 times [2018-11-07 16:46:18,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 199 proven. 253 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:46:19,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:19,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:19,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:19,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:19,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:19,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:19,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:19,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:19,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 16:46:19,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:19,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 331 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 16:46:19,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 331 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 16:46:19,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:19,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 20 [2018-11-07 16:46:19,532 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:19,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:46:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:46:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:46:19,534 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 20 states. [2018-11-07 16:46:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:19,984 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-11-07 16:46:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:46:19,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-11-07 16:46:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:19,986 INFO L225 Difference]: With dead ends: 126 [2018-11-07 16:46:19,986 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 16:46:19,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 16:46:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 16:46:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-11-07 16:46:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 16:46:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-07 16:46:19,995 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2018-11-07 16:46:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:19,996 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-07 16:46:19,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:46:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-07 16:46:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 16:46:19,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:19,997 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:19,997 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:19,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 749036814, now seen corresponding path program 12 times [2018-11-07 16:46:19,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:19,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:19,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 300 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:20,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:20,237 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:20,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:20,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,238 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:20,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:20,255 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:20,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:20,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:20,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 300 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:20,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 300 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:20,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:46:20,680 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:20,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:46:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:46:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:46:20,681 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 15 states. [2018-11-07 16:46:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:20,730 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-11-07 16:46:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:46:20,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-11-07 16:46:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:20,731 INFO L225 Difference]: With dead ends: 117 [2018-11-07 16:46:20,731 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 16:46:20,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:46:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 16:46:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-07 16:46:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-07 16:46:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-11-07 16:46:20,739 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 81 [2018-11-07 16:46:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:20,739 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-11-07 16:46:20,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:46:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-11-07 16:46:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 16:46:20,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:20,741 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:20,741 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:20,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1642380092, now seen corresponding path program 13 times [2018-11-07 16:46:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:20,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:20,742 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 351 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:20,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:20,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:20,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:20,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:20,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:20,932 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:20,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 351 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:20,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 351 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:21,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:21,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:46:21,406 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:21,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:46:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:46:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:46:21,407 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 16 states. [2018-11-07 16:46:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:21,537 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2018-11-07 16:46:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:46:21,538 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2018-11-07 16:46:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:21,539 INFO L225 Difference]: With dead ends: 121 [2018-11-07 16:46:21,539 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 16:46:21,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:46:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 16:46:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-07 16:46:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 16:46:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-11-07 16:46:21,548 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 85 [2018-11-07 16:46:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:21,548 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-11-07 16:46:21,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:46:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-07 16:46:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 16:46:21,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:21,555 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:21,555 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:21,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1643034006, now seen corresponding path program 14 times [2018-11-07 16:46:21,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:21,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 309 proven. 406 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:46:21,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:21,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:21,959 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:21,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:21,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:21,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:21,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:21,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:22,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 16:46:22,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:22,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 517 proven. 111 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-07 16:46:22,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 517 proven. 111 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-07 16:46:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:22,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 24 [2018-11-07 16:46:22,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:22,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:46:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:46:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:22,484 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 24 states. [2018-11-07 16:46:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:22,945 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-07 16:46:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 16:46:22,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 89 [2018-11-07 16:46:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:22,949 INFO L225 Difference]: With dead ends: 150 [2018-11-07 16:46:22,949 INFO L226 Difference]: Without dead ends: 120 [2018-11-07 16:46:22,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 160 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=575, Invalid=1405, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:46:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-07 16:46:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2018-11-07 16:46:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 16:46:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-11-07 16:46:22,958 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 89 [2018-11-07 16:46:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:22,958 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-11-07 16:46:22,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:46:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-11-07 16:46:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 16:46:22,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:22,960 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:22,960 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:22,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -172397820, now seen corresponding path program 15 times [2018-11-07 16:46:22,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:22,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:22,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 465 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:23,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:23,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:23,299 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:23,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:23,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:23,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:23,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:23,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:23,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:23,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:23,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 465 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:23,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 465 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:24,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:24,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:46:24,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:24,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:46:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:46:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:24,149 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 18 states. [2018-11-07 16:46:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:24,216 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-11-07 16:46:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:46:24,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2018-11-07 16:46:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:24,217 INFO L225 Difference]: With dead ends: 137 [2018-11-07 16:46:24,217 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 16:46:24,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 16:46:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-07 16:46:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 16:46:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-11-07 16:46:24,225 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 97 [2018-11-07 16:46:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:24,226 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-11-07 16:46:24,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:46:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-07 16:46:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 16:46:24,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:24,227 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:24,228 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:24,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1544725810, now seen corresponding path program 16 times [2018-11-07 16:46:24,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:24,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:24,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 528 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:24,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:24,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:24,491 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:24,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:24,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:24,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:24,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:24,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:24,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 528 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:24,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 528 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:25,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:25,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:46:25,240 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:25,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:46:25,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:46:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:25,241 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 19 states. [2018-11-07 16:46:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:25,432 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-11-07 16:46:25,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:46:25,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2018-11-07 16:46:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:25,434 INFO L225 Difference]: With dead ends: 141 [2018-11-07 16:46:25,434 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 16:46:25,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 16:46:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-11-07 16:46:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-07 16:46:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-11-07 16:46:25,440 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 101 [2018-11-07 16:46:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-11-07 16:46:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:46:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-11-07 16:46:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-07 16:46:25,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:25,441 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:25,442 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:25,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash 566696032, now seen corresponding path program 17 times [2018-11-07 16:46:25,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:25,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:25,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 443 proven. 595 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:46:25,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:25,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:25,715 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:25,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:25,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:25,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:25,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:25,725 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:25,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-07 16:46:25,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:25,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 743 proven. 157 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-07 16:46:25,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 743 proven. 157 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-07 16:46:26,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:26,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2018-11-07 16:46:26,035 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:26,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:46:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:46:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:46:26,036 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 28 states. [2018-11-07 16:46:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:26,429 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-11-07 16:46:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 16:46:26,429 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2018-11-07 16:46:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:26,430 INFO L225 Difference]: With dead ends: 174 [2018-11-07 16:46:26,430 INFO L226 Difference]: Without dead ends: 140 [2018-11-07 16:46:26,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 189 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=790, Invalid=1966, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 16:46:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-07 16:46:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-11-07 16:46:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 16:46:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-11-07 16:46:26,439 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 105 [2018-11-07 16:46:26,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:26,439 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-11-07 16:46:26,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:46:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-11-07 16:46:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 16:46:26,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:26,440 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 18, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:26,440 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:26,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -223399430, now seen corresponding path program 18 times [2018-11-07 16:46:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:26,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:26,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 543 proven. 666 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:27,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:27,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:27,259 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:27,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:27,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:27,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:27,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:27,267 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:27,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:27,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:27,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 543 proven. 666 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:27,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 543 proven. 666 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:27,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:27,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 16:46:27,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:27,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:46:27,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:46:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:46:27,788 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 21 states. [2018-11-07 16:46:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:27,885 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2018-11-07 16:46:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:46:27,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2018-11-07 16:46:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:27,886 INFO L225 Difference]: With dead ends: 157 [2018-11-07 16:46:27,886 INFO L226 Difference]: Without dead ends: 119 [2018-11-07 16:46:27,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:46:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-07 16:46:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-11-07 16:46:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 16:46:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-11-07 16:46:27,894 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 113 [2018-11-07 16:46:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:27,894 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-11-07 16:46:27,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:46:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-11-07 16:46:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 16:46:27,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:27,896 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:27,896 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:27,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2116399064, now seen corresponding path program 19 times [2018-11-07 16:46:27,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:27,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:27,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 572 proven. 741 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:28,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:28,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:28,285 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:28,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:28,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:28,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:28,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:28,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 572 proven. 741 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:28,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 572 proven. 741 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:28,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:28,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 16:46:28,855 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:28,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:46:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:46:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:46:28,857 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 22 states. [2018-11-07 16:46:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:28,946 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-11-07 16:46:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:46:28,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 117 [2018-11-07 16:46:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:28,949 INFO L225 Difference]: With dead ends: 161 [2018-11-07 16:46:28,949 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 16:46:28,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:46:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 16:46:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-07 16:46:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 16:46:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-11-07 16:46:28,957 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 117 [2018-11-07 16:46:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:28,958 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-11-07 16:46:28,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:46:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-07 16:46:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 16:46:28,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:28,959 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 20, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:28,959 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:28,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash 751740758, now seen corresponding path program 20 times [2018-11-07 16:46:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:28,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 601 proven. 820 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:46:29,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:29,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:29,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:29,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:29,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:29,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:29,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:29,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:29,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 16:46:29,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:29,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1009 proven. 211 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-07 16:46:29,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1009 proven. 211 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-07 16:46:30,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:30,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 32 [2018-11-07 16:46:30,039 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:30,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:46:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:46:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:46:30,040 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 32 states. [2018-11-07 16:46:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:30,486 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-07 16:46:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:46:30,487 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 121 [2018-11-07 16:46:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:30,488 INFO L225 Difference]: With dead ends: 198 [2018-11-07 16:46:30,488 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 16:46:30,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 218 SyntacticMatches, 16 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1039, Invalid=2621, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:46:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 16:46:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2018-11-07 16:46:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-07 16:46:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-11-07 16:46:30,498 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 121 [2018-11-07 16:46:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:30,498 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-11-07 16:46:30,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:46:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-11-07 16:46:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 16:46:30,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:30,500 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 21, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:30,500 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:30,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 702953968, now seen corresponding path program 21 times [2018-11-07 16:46:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:30,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:30,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 903 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:30,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:30,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:30,807 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:30,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:30,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:30,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:30,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:30,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:30,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:30,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 903 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:30,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 903 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:31,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 16:46:31,457 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:31,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:46:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:46:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:46:31,459 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 24 states. [2018-11-07 16:46:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:31,575 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2018-11-07 16:46:31,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:46:31,575 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 129 [2018-11-07 16:46:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:31,576 INFO L225 Difference]: With dead ends: 177 [2018-11-07 16:46:31,577 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 16:46:31,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:46:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 16:46:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-07 16:46:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-07 16:46:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-11-07 16:46:31,589 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 129 [2018-11-07 16:46:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-11-07 16:46:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:46:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-07 16:46:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 16:46:31,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:31,590 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:31,590 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:31,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:31,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1771781150, now seen corresponding path program 22 times [2018-11-07 16:46:31,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:31,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:31,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:31,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:31,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 750 proven. 990 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:31,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:31,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:31,902 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:31,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:31,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:31,903 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:31,911 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:31,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 750 proven. 990 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:31,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 750 proven. 990 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:32,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:32,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 16:46:32,830 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:32,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:46:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:46:32,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:46:32,831 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 25 states. [2018-11-07 16:46:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:32,902 INFO L93 Difference]: Finished difference Result 181 states and 200 transitions. [2018-11-07 16:46:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:46:32,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-11-07 16:46:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:32,903 INFO L225 Difference]: With dead ends: 181 [2018-11-07 16:46:32,903 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 16:46:32,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:46:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 16:46:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-11-07 16:46:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 16:46:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2018-11-07 16:46:32,911 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 133 [2018-11-07 16:46:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:32,912 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2018-11-07 16:46:32,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:46:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2018-11-07 16:46:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 16:46:32,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:32,912 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 23, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:32,913 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:32,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash -444106932, now seen corresponding path program 23 times [2018-11-07 16:46:32,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 783 proven. 1081 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:46:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:33,349 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:33,349 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:33,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:33,349 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:33,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:33,357 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:33,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 16:46:33,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:33,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1315 proven. 273 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-07 16:46:33,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1315 proven. 273 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-07 16:46:33,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:33,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 36 [2018-11-07 16:46:33,892 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:33,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:46:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:46:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:33,893 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 36 states. [2018-11-07 16:46:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:34,477 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2018-11-07 16:46:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:46:34,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 137 [2018-11-07 16:46:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:34,478 INFO L225 Difference]: With dead ends: 222 [2018-11-07 16:46:34,479 INFO L226 Difference]: Without dead ends: 180 [2018-11-07 16:46:34,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 247 SyntacticMatches, 18 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1322, Invalid=3370, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 16:46:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-07 16:46:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2018-11-07 16:46:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-07 16:46:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-11-07 16:46:34,490 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 137 [2018-11-07 16:46:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:34,491 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-11-07 16:46:34,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:46:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-11-07 16:46:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 16:46:34,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:34,492 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 24, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:34,492 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:34,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash 368968422, now seen corresponding path program 24 times [2018-11-07 16:46:34,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:34,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:34,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 915 proven. 1176 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:34,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:34,929 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:34,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:34,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:34,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:34,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:34,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:34,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:34,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 915 proven. 1176 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:35,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 915 proven. 1176 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:35,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:35,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 16:46:35,785 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:35,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:46:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:46:35,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:35,787 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 27 states. [2018-11-07 16:46:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:35,934 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2018-11-07 16:46:35,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:46:35,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-11-07 16:46:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:35,943 INFO L225 Difference]: With dead ends: 197 [2018-11-07 16:46:35,943 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 16:46:35,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 16:46:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-11-07 16:46:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 16:46:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-11-07 16:46:35,956 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 145 [2018-11-07 16:46:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:35,957 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-11-07 16:46:35,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:46:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-07 16:46:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 16:46:35,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:35,958 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:35,958 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:35,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 502589716, now seen corresponding path program 25 times [2018-11-07 16:46:35,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 952 proven. 1275 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:36,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,307 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:36,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:36,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:36,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:36,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:36,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:36,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 952 proven. 1275 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:36,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 952 proven. 1275 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:37,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:37,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2018-11-07 16:46:37,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:37,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:46:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:46:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:37,238 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 28 states. [2018-11-07 16:46:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:37,426 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2018-11-07 16:46:37,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:46:37,426 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 149 [2018-11-07 16:46:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:37,427 INFO L225 Difference]: With dead ends: 201 [2018-11-07 16:46:37,427 INFO L226 Difference]: Without dead ends: 155 [2018-11-07 16:46:37,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-07 16:46:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-11-07 16:46:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 16:46:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-11-07 16:46:37,436 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 149 [2018-11-07 16:46:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:37,436 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-11-07 16:46:37,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:46:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-11-07 16:46:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 16:46:37,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:37,437 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:37,438 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:37,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash -426702782, now seen corresponding path program 26 times [2018-11-07 16:46:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:37,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:37,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 989 proven. 1378 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:46:38,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:38,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:38,375 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:38,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:38,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:38,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:38,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:38,385 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:38,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 16:46:38,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:38,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1661 proven. 343 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-11-07 16:46:38,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1661 proven. 343 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-11-07 16:46:40,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:40,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13] total 40 [2018-11-07 16:46:40,748 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:40,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:46:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:46:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1077, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:46:40,749 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 40 states. [2018-11-07 16:46:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:42,009 INFO L93 Difference]: Finished difference Result 246 states and 278 transitions. [2018-11-07 16:46:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 16:46:42,009 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 153 [2018-11-07 16:46:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:42,010 INFO L225 Difference]: With dead ends: 246 [2018-11-07 16:46:42,010 INFO L226 Difference]: Without dead ends: 200 [2018-11-07 16:46:42,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 276 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1639, Invalid=4213, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 16:46:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-07 16:46:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2018-11-07 16:46:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 16:46:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-11-07 16:46:42,025 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 153 [2018-11-07 16:46:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:42,026 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-11-07 16:46:42,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:46:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-11-07 16:46:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 16:46:42,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:42,027 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 27, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:42,027 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:42,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:42,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2049569572, now seen corresponding path program 27 times [2018-11-07 16:46:42,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:42,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:42,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:42,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:42,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1137 proven. 1485 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:43,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:43,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:43,265 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:43,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:43,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:43,266 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:43,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:43,278 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:43,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:43,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:43,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1137 proven. 1485 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:43,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1137 proven. 1485 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2018-11-07 16:46:44,128 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:46:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:46:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:44,130 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 30 states. [2018-11-07 16:46:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:44,279 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2018-11-07 16:46:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 16:46:44,282 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 161 [2018-11-07 16:46:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:44,283 INFO L225 Difference]: With dead ends: 217 [2018-11-07 16:46:44,283 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 16:46:44,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 295 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 16:46:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-11-07 16:46:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-07 16:46:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-11-07 16:46:44,297 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 161 [2018-11-07 16:46:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:44,298 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-11-07 16:46:44,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:46:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-11-07 16:46:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-07 16:46:44,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:44,299 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 28, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:44,299 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:44,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -37300470, now seen corresponding path program 28 times [2018-11-07 16:46:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:44,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:44,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1178 proven. 1596 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:45,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:45,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:45,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:45,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:45,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:45,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:45,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:45,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:45,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1178 proven. 1596 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:45,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1178 proven. 1596 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:46,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:46,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2018-11-07 16:46:46,208 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:46,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:46:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:46:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:46,209 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 31 states. [2018-11-07 16:46:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:46,351 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2018-11-07 16:46:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:46:46,361 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2018-11-07 16:46:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:46,362 INFO L225 Difference]: With dead ends: 221 [2018-11-07 16:46:46,362 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 16:46:46,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 302 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 16:46:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-11-07 16:46:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-07 16:46:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2018-11-07 16:46:46,376 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 165 [2018-11-07 16:46:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:46,377 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2018-11-07 16:46:46,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:46:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2018-11-07 16:46:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 16:46:46,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:46,378 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 29, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:46,378 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:46,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash 516610616, now seen corresponding path program 29 times [2018-11-07 16:46:46,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:46,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:46,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:46,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1219 proven. 1711 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:46:47,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:47,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:47,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:47,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:47,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:47,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:47,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:47,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:47,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 16:46:47,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:47,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2047 proven. 421 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2018-11-07 16:46:47,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2047 proven. 421 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2018-11-07 16:46:48,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:48,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14, 14] total 44 [2018-11-07 16:46:48,142 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:48,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:46:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:46:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1306, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:46:48,144 INFO L87 Difference]: Start difference. First operand 170 states and 181 transitions. Second operand 44 states. [2018-11-07 16:46:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:49,067 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2018-11-07 16:46:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:46:49,067 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-11-07 16:46:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:49,068 INFO L225 Difference]: With dead ends: 270 [2018-11-07 16:46:49,068 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 16:46:49,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 305 SyntacticMatches, 22 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1990, Invalid=5150, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 16:46:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 16:46:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 178. [2018-11-07 16:46:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-07 16:46:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2018-11-07 16:46:49,084 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 169 [2018-11-07 16:46:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:49,084 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2018-11-07 16:46:49,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:46:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2018-11-07 16:46:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-07 16:46:49,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:49,086 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 30, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:49,086 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:49,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2089670610, now seen corresponding path program 30 times [2018-11-07 16:46:49,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:49,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:49,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:49,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:49,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1383 proven. 1830 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:49,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:49,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:49,601 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:49,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:49,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:49,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:49,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:49,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:49,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:49,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:49,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1383 proven. 1830 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:49,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1383 proven. 1830 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:50,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:50,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2018-11-07 16:46:50,518 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:50,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:46:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:46:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:50,520 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand 33 states. [2018-11-07 16:46:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:50,634 INFO L93 Difference]: Finished difference Result 237 states and 262 transitions. [2018-11-07 16:46:50,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:46:50,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 177 [2018-11-07 16:46:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:50,642 INFO L225 Difference]: With dead ends: 237 [2018-11-07 16:46:50,642 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 16:46:50,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 324 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 16:46:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-07 16:46:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-07 16:46:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2018-11-07 16:46:50,659 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 177 [2018-11-07 16:46:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:50,659 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2018-11-07 16:46:50,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:46:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2018-11-07 16:46:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 16:46:50,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:50,660 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 31, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:50,661 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:50,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:50,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1674541568, now seen corresponding path program 31 times [2018-11-07 16:46:50,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:50,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:50,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1428 proven. 1953 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:51,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:51,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:51,908 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:51,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:51,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:51,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:51,931 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:51,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1428 proven. 1953 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:52,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1428 proven. 1953 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:53,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:53,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2018-11-07 16:46:53,192 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:53,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:46:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:46:53,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:53,193 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand 34 states. [2018-11-07 16:46:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:53,464 INFO L93 Difference]: Finished difference Result 241 states and 266 transitions. [2018-11-07 16:46:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 16:46:53,464 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 181 [2018-11-07 16:46:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:53,465 INFO L225 Difference]: With dead ends: 241 [2018-11-07 16:46:53,465 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 16:46:53,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 331 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 16:46:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-11-07 16:46:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 16:46:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2018-11-07 16:46:53,481 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 181 [2018-11-07 16:46:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:53,481 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2018-11-07 16:46:53,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:46:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2018-11-07 16:46:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 16:46:53,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:53,483 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 32, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:53,483 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:53,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1319867090, now seen corresponding path program 32 times [2018-11-07 16:46:53,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:53,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:53,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1473 proven. 2080 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:46:54,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:54,194 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:54,194 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:54,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:54,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:54,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:54,204 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:54,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 16:46:54,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:54,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2473 proven. 507 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2018-11-07 16:46:54,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2473 proven. 507 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2018-11-07 16:46:55,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:55,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 15, 15] total 48 [2018-11-07 16:46:55,146 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:55,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 16:46:55,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 16:46:55,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=1557, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:46:55,147 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand 48 states. [2018-11-07 16:46:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:56,027 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2018-11-07 16:46:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 16:46:56,027 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 185 [2018-11-07 16:46:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:56,028 INFO L225 Difference]: With dead ends: 294 [2018-11-07 16:46:56,029 INFO L226 Difference]: Without dead ends: 240 [2018-11-07 16:46:56,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 334 SyntacticMatches, 24 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2375, Invalid=6181, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 16:46:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-07 16:46:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 194. [2018-11-07 16:46:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 16:46:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2018-11-07 16:46:56,049 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 185 [2018-11-07 16:46:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:56,049 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2018-11-07 16:46:56,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 16:46:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2018-11-07 16:46:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 16:46:56,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:56,051 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 33, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:56,051 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:56,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash 293921736, now seen corresponding path program 33 times [2018-11-07 16:46:56,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:56,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:56,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 1653 proven. 2211 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:46:56,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:56,662 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:56,662 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:56,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:56,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:56,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:56,671 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:56,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:56,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:56,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 1653 proven. 2211 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:46:56,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 1653 proven. 2211 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:46:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:57,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2018-11-07 16:46:57,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:57,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:46:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:46:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:57,616 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand 36 states. [2018-11-07 16:46:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:57,745 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2018-11-07 16:46:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 16:46:57,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 193 [2018-11-07 16:46:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:57,747 INFO L225 Difference]: With dead ends: 257 [2018-11-07 16:46:57,747 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 16:46:57,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 353 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 16:46:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-07 16:46:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 16:46:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 211 transitions. [2018-11-07 16:46:57,766 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 211 transitions. Word has length 193 [2018-11-07 16:46:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:57,766 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 211 transitions. [2018-11-07 16:46:57,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:46:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 211 transitions. [2018-11-07 16:46:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 16:46:57,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:57,768 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 34, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:57,768 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:57,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1601079818, now seen corresponding path program 34 times [2018-11-07 16:46:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:57,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:57,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1702 proven. 2346 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:46:58,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:58,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:58,448 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:58,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:58,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:58,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:58,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:58,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:58,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1702 proven. 2346 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:46:58,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1702 proven. 2346 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:46:59,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:59,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2018-11-07 16:46:59,409 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:59,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:46:59,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:46:59,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:59,410 INFO L87 Difference]: Start difference. First operand 198 states and 211 transitions. Second operand 37 states. [2018-11-07 16:46:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:59,545 INFO L93 Difference]: Finished difference Result 261 states and 288 transitions. [2018-11-07 16:46:59,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:46:59,546 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 197 [2018-11-07 16:46:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:59,547 INFO L225 Difference]: With dead ends: 261 [2018-11-07 16:46:59,547 INFO L226 Difference]: Without dead ends: 203 [2018-11-07 16:46:59,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 360 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-07 16:46:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-11-07 16:46:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-07 16:46:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2018-11-07 16:46:59,567 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 197 [2018-11-07 16:46:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:59,567 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2018-11-07 16:46:59,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:46:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2018-11-07 16:46:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 16:46:59,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:59,569 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 35, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:59,569 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:59,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash -712163036, now seen corresponding path program 35 times [2018-11-07 16:46:59,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:59,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:59,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1751 proven. 2485 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:47:00,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:00,526 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:00,526 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:00,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:00,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:00,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:00,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:00,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:00,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 16:47:00,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:00,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2939 proven. 601 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-11-07 16:47:00,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2939 proven. 601 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-11-07 16:47:01,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:01,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16, 16] total 52 [2018-11-07 16:47:01,492 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:01,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 16:47:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 16:47:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=1830, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:01,494 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand 52 states. [2018-11-07 16:47:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:02,545 INFO L93 Difference]: Finished difference Result 318 states and 359 transitions. [2018-11-07 16:47:02,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 16:47:02,545 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 201 [2018-11-07 16:47:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:02,546 INFO L225 Difference]: With dead ends: 318 [2018-11-07 16:47:02,546 INFO L226 Difference]: Without dead ends: 260 [2018-11-07 16:47:02,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 363 SyntacticMatches, 26 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2794, Invalid=7306, Unknown=0, NotChecked=0, Total=10100 [2018-11-07 16:47:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-07 16:47:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 210. [2018-11-07 16:47:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 16:47:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2018-11-07 16:47:02,571 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 201 [2018-11-07 16:47:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:02,571 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2018-11-07 16:47:02,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 16:47:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2018-11-07 16:47:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 16:47:02,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:02,572 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 36, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:02,573 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:02,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1348120766, now seen corresponding path program 36 times [2018-11-07 16:47:02,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:02,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:02,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1947 proven. 2628 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:03,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:03,558 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:03,558 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:03,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:03,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:03,559 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:03,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:03,569 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:03,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:03,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:03,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1947 proven. 2628 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:03,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1947 proven. 2628 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:04,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:04,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2018-11-07 16:47:04,528 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:04,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:47:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:47:04,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:04,529 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand 39 states. [2018-11-07 16:47:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:04,689 INFO L93 Difference]: Finished difference Result 277 states and 306 transitions. [2018-11-07 16:47:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:47:04,689 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-11-07 16:47:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:04,690 INFO L225 Difference]: With dead ends: 277 [2018-11-07 16:47:04,690 INFO L226 Difference]: Without dead ends: 215 [2018-11-07 16:47:04,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 382 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-07 16:47:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-11-07 16:47:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 16:47:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2018-11-07 16:47:04,713 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 209 [2018-11-07 16:47:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:04,714 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 228 transitions. [2018-11-07 16:47:04,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:47:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 228 transitions. [2018-11-07 16:47:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-07 16:47:04,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:04,715 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 37, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:04,716 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:04,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1500961044, now seen corresponding path program 37 times [2018-11-07 16:47:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:04,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:04,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2000 proven. 2775 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:05,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:05,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:05,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:05,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:05,699 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:05,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2000 proven. 2775 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:05,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2000 proven. 2775 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:07,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:07,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2018-11-07 16:47:07,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:07,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:47:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:47:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:07,294 INFO L87 Difference]: Start difference. First operand 214 states and 228 transitions. Second operand 40 states. [2018-11-07 16:47:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:07,421 INFO L93 Difference]: Finished difference Result 281 states and 310 transitions. [2018-11-07 16:47:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:47:07,421 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 213 [2018-11-07 16:47:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:07,422 INFO L225 Difference]: With dead ends: 281 [2018-11-07 16:47:07,422 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 16:47:07,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 389 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 16:47:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2018-11-07 16:47:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 16:47:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 232 transitions. [2018-11-07 16:47:07,445 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 232 transitions. Word has length 213 [2018-11-07 16:47:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:07,445 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 232 transitions. [2018-11-07 16:47:07,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:47:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 232 transitions. [2018-11-07 16:47:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 16:47:07,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:07,446 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 38, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:07,447 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:07,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1223371238, now seen corresponding path program 38 times [2018-11-07 16:47:07,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:07,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:07,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:07,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2053 proven. 2926 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:47:09,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:09,472 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:09,473 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:09,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:09,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:09,473 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:09,482 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:09,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 16:47:09,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:09,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 3445 proven. 703 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2018-11-07 16:47:10,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 3445 proven. 703 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2018-11-07 16:47:10,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:10,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 17, 17] total 56 [2018-11-07 16:47:10,696 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:10,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 16:47:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 16:47:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2125, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 16:47:10,697 INFO L87 Difference]: Start difference. First operand 218 states and 232 transitions. Second operand 56 states. [2018-11-07 16:47:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:11,823 INFO L93 Difference]: Finished difference Result 342 states and 386 transitions. [2018-11-07 16:47:11,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 16:47:11,824 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 217 [2018-11-07 16:47:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:11,825 INFO L225 Difference]: With dead ends: 342 [2018-11-07 16:47:11,825 INFO L226 Difference]: Without dead ends: 280 [2018-11-07 16:47:11,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 392 SyntacticMatches, 28 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3247, Invalid=8525, Unknown=0, NotChecked=0, Total=11772 [2018-11-07 16:47:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-07 16:47:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 226. [2018-11-07 16:47:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-07 16:47:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 241 transitions. [2018-11-07 16:47:11,847 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 241 transitions. Word has length 217 [2018-11-07 16:47:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:11,847 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 241 transitions. [2018-11-07 16:47:11,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 16:47:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 241 transitions. [2018-11-07 16:47:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 16:47:11,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:11,849 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 39, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:11,849 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:11,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 418299572, now seen corresponding path program 39 times [2018-11-07 16:47:11,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:11,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:11,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2265 proven. 3081 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:12,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:12,593 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:12,594 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:12,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:12,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:12,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:12,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:12,603 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:12,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:12,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:12,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2265 proven. 3081 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:12,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2265 proven. 3081 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:14,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:14,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2018-11-07 16:47:14,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:14,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:47:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:47:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:14,107 INFO L87 Difference]: Start difference. First operand 226 states and 241 transitions. Second operand 42 states. [2018-11-07 16:47:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:14,274 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2018-11-07 16:47:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:47:14,274 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 225 [2018-11-07 16:47:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:14,276 INFO L225 Difference]: With dead ends: 297 [2018-11-07 16:47:14,276 INFO L226 Difference]: Without dead ends: 231 [2018-11-07 16:47:14,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 411 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-07 16:47:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2018-11-07 16:47:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-07 16:47:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 245 transitions. [2018-11-07 16:47:14,299 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 245 transitions. Word has length 225 [2018-11-07 16:47:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:14,299 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 245 transitions. [2018-11-07 16:47:14,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:47:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 245 transitions. [2018-11-07 16:47:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 16:47:14,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:14,301 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 40, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:14,301 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:14,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash 502733026, now seen corresponding path program 40 times [2018-11-07 16:47:14,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:14,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:14,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2322 proven. 3240 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:15,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:15,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:15,037 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:15,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:15,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:15,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:15,046 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:15,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2322 proven. 3240 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:15,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2322 proven. 3240 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:16,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2018-11-07 16:47:16,065 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:16,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:47:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:47:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:16,066 INFO L87 Difference]: Start difference. First operand 230 states and 245 transitions. Second operand 43 states. [2018-11-07 16:47:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:16,235 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2018-11-07 16:47:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:47:16,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-11-07 16:47:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:16,238 INFO L225 Difference]: With dead ends: 301 [2018-11-07 16:47:16,238 INFO L226 Difference]: Without dead ends: 235 [2018-11-07 16:47:16,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 418 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-07 16:47:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2018-11-07 16:47:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 16:47:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 249 transitions. [2018-11-07 16:47:16,265 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 249 transitions. Word has length 229 [2018-11-07 16:47:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:16,266 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 249 transitions. [2018-11-07 16:47:16,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:47:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 249 transitions. [2018-11-07 16:47:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-07 16:47:16,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:16,267 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 41, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:16,268 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:16,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1439345680, now seen corresponding path program 41 times [2018-11-07 16:47:16,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:16,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:16,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2379 proven. 3403 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:47:17,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:17,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:17,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:17,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:17,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:17,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:17,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:17,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:17,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-07 16:47:17,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:17,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3991 proven. 813 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2018-11-07 16:47:17,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3991 proven. 813 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2018-11-07 16:47:18,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:18,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 18, 18] total 60 [2018-11-07 16:47:18,681 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:18,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 16:47:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 16:47:18,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1098, Invalid=2442, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 16:47:18,682 INFO L87 Difference]: Start difference. First operand 234 states and 249 transitions. Second operand 60 states. [2018-11-07 16:47:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:19,936 INFO L93 Difference]: Finished difference Result 366 states and 413 transitions. [2018-11-07 16:47:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-07 16:47:19,936 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 233 [2018-11-07 16:47:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:19,937 INFO L225 Difference]: With dead ends: 366 [2018-11-07 16:47:19,937 INFO L226 Difference]: Without dead ends: 300 [2018-11-07 16:47:19,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 421 SyntacticMatches, 30 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3888 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3734, Invalid=9838, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 16:47:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-07 16:47:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 242. [2018-11-07 16:47:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-07 16:47:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 258 transitions. [2018-11-07 16:47:19,969 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 258 transitions. Word has length 233 [2018-11-07 16:47:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:19,969 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 258 transitions. [2018-11-07 16:47:19,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 16:47:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 258 transitions. [2018-11-07 16:47:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-07 16:47:19,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:19,971 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 42, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:19,971 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:19,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash -10449494, now seen corresponding path program 42 times [2018-11-07 16:47:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 2607 proven. 3570 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:21,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:21,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:21,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:21,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:21,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:21,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:21,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:21,177 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:21,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:21,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:21,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 2607 proven. 3570 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:21,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 2607 proven. 3570 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2018-11-07 16:47:22,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:22,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 16:47:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 16:47:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:22,386 INFO L87 Difference]: Start difference. First operand 242 states and 258 transitions. Second operand 45 states. [2018-11-07 16:47:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:23,319 INFO L93 Difference]: Finished difference Result 317 states and 350 transitions. [2018-11-07 16:47:23,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:47:23,320 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 241 [2018-11-07 16:47:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:23,321 INFO L225 Difference]: With dead ends: 317 [2018-11-07 16:47:23,321 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 16:47:23,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 440 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 16:47:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-11-07 16:47:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-07 16:47:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 262 transitions. [2018-11-07 16:47:23,358 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 262 transitions. Word has length 241 [2018-11-07 16:47:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:23,359 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 262 transitions. [2018-11-07 16:47:23,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 16:47:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 262 transitions. [2018-11-07 16:47:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 16:47:23,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:23,361 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 43, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:23,361 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:23,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash 721079256, now seen corresponding path program 43 times [2018-11-07 16:47:23,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:23,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:23,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2668 proven. 3741 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:24,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:24,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:24,452 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:24,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:24,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:24,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:24,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:24,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2668 proven. 3741 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:24,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2668 proven. 3741 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:25,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:25,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2018-11-07 16:47:25,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:25,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 16:47:25,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 16:47:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:25,714 INFO L87 Difference]: Start difference. First operand 246 states and 262 transitions. Second operand 46 states. [2018-11-07 16:47:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:25,908 INFO L93 Difference]: Finished difference Result 321 states and 354 transitions. [2018-11-07 16:47:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 16:47:25,908 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 245 [2018-11-07 16:47:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:25,909 INFO L225 Difference]: With dead ends: 321 [2018-11-07 16:47:25,910 INFO L226 Difference]: Without dead ends: 251 [2018-11-07 16:47:25,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 447 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-07 16:47:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2018-11-07 16:47:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-07 16:47:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 266 transitions. [2018-11-07 16:47:25,932 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 266 transitions. Word has length 245 [2018-11-07 16:47:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:25,932 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 266 transitions. [2018-11-07 16:47:25,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 16:47:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 266 transitions. [2018-11-07 16:47:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-07 16:47:25,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:25,933 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 44, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:25,933 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:25,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1708016390, now seen corresponding path program 44 times [2018-11-07 16:47:25,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:25,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 2729 proven. 3916 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:47:26,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:26,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:26,987 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:26,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:26,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:26,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:26,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:26,997 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:27,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-11-07 16:47:27,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:27,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 4577 proven. 931 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2018-11-07 16:47:27,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 4577 proven. 931 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2018-11-07 16:47:28,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:28,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 19, 19] total 64 [2018-11-07 16:47:28,773 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:28,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-07 16:47:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-07 16:47:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=2781, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:47:28,774 INFO L87 Difference]: Start difference. First operand 250 states and 266 transitions. Second operand 64 states. [2018-11-07 16:47:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:30,176 INFO L93 Difference]: Finished difference Result 390 states and 440 transitions. [2018-11-07 16:47:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-07 16:47:30,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 249 [2018-11-07 16:47:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:30,178 INFO L225 Difference]: With dead ends: 390 [2018-11-07 16:47:30,178 INFO L226 Difference]: Without dead ends: 320 [2018-11-07 16:47:30,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 450 SyntacticMatches, 32 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4451 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4255, Invalid=11245, Unknown=0, NotChecked=0, Total=15500 [2018-11-07 16:47:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-07 16:47:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 258. [2018-11-07 16:47:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-07 16:47:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 275 transitions. [2018-11-07 16:47:30,215 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 275 transitions. Word has length 249 [2018-11-07 16:47:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:30,216 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 275 transitions. [2018-11-07 16:47:30,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-07 16:47:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 275 transitions. [2018-11-07 16:47:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 16:47:30,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:30,218 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 45, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:30,218 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:30,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash 739220896, now seen corresponding path program 45 times [2018-11-07 16:47:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:30,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:30,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 2973 proven. 4095 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:31,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:31,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:31,149 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:31,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:31,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:31,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:31,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:31,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:31,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:31,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:31,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 2973 proven. 4095 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:31,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 2973 proven. 4095 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:32,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:32,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2018-11-07 16:47:32,208 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:32,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 16:47:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 16:47:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:32,210 INFO L87 Difference]: Start difference. First operand 258 states and 275 transitions. Second operand 48 states. [2018-11-07 16:47:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:32,433 INFO L93 Difference]: Finished difference Result 337 states and 372 transitions. [2018-11-07 16:47:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 16:47:32,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 257 [2018-11-07 16:47:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:32,434 INFO L225 Difference]: With dead ends: 337 [2018-11-07 16:47:32,434 INFO L226 Difference]: Without dead ends: 263 [2018-11-07 16:47:32,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 469 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-07 16:47:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2018-11-07 16:47:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-07 16:47:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 279 transitions. [2018-11-07 16:47:32,471 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 279 transitions. Word has length 257 [2018-11-07 16:47:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:32,471 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 279 transitions. [2018-11-07 16:47:32,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 16:47:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 279 transitions. [2018-11-07 16:47:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 16:47:32,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:32,473 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 46, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:32,474 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:32,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2047623218, now seen corresponding path program 46 times [2018-11-07 16:47:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:32,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:32,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3038 proven. 4278 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:33,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:33,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:33,465 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:33,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:33,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:33,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:33,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:33,494 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:33,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3038 proven. 4278 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:33,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3038 proven. 4278 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:34,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:34,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2018-11-07 16:47:34,716 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:34,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 16:47:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 16:47:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:34,717 INFO L87 Difference]: Start difference. First operand 262 states and 279 transitions. Second operand 49 states. [2018-11-07 16:47:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:35,211 INFO L93 Difference]: Finished difference Result 341 states and 376 transitions. [2018-11-07 16:47:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 16:47:35,211 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 261 [2018-11-07 16:47:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:35,212 INFO L225 Difference]: With dead ends: 341 [2018-11-07 16:47:35,212 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 16:47:35,213 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 476 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 16:47:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2018-11-07 16:47:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-07 16:47:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-11-07 16:47:35,246 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 261 [2018-11-07 16:47:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:35,247 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-11-07 16:47:35,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 16:47:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-11-07 16:47:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-07 16:47:35,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:35,249 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 47, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:35,249 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:35,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 796859132, now seen corresponding path program 47 times [2018-11-07 16:47:35,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:35,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:35,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:35,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:35,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 3103 proven. 4465 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:47:36,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:36,217 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:36,217 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:36,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:36,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:36,217 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:36,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:36,226 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:36,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-07 16:47:36,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:36,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 5203 proven. 1057 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2018-11-07 16:47:37,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 5203 proven. 1057 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2018-11-07 16:47:38,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:38,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 20, 20] total 68 [2018-11-07 16:47:38,321 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:38,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 16:47:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 16:47:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1414, Invalid=3142, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 16:47:38,323 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 68 states. [2018-11-07 16:47:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:40,072 INFO L93 Difference]: Finished difference Result 414 states and 467 transitions. [2018-11-07 16:47:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-07 16:47:40,073 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 265 [2018-11-07 16:47:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:40,074 INFO L225 Difference]: With dead ends: 414 [2018-11-07 16:47:40,074 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 16:47:40,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 479 SyntacticMatches, 34 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5052 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4810, Invalid=12746, Unknown=0, NotChecked=0, Total=17556 [2018-11-07 16:47:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 16:47:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 274. [2018-11-07 16:47:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 16:47:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 292 transitions. [2018-11-07 16:47:40,106 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 292 transitions. Word has length 265 [2018-11-07 16:47:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:40,107 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 292 transitions. [2018-11-07 16:47:40,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 16:47:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 292 transitions. [2018-11-07 16:47:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-07 16:47:40,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:40,108 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 48, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:40,109 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:40,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1000042134, now seen corresponding path program 48 times [2018-11-07 16:47:40,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:40,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:40,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 3363 proven. 4656 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:47:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:41,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:41,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:41,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:41,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:41,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:41,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:41,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:41,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 3363 proven. 4656 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:47:41,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 3363 proven. 4656 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:47:42,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:42,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2018-11-07 16:47:42,363 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:42,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 16:47:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 16:47:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:42,364 INFO L87 Difference]: Start difference. First operand 274 states and 292 transitions. Second operand 51 states. [2018-11-07 16:47:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:42,579 INFO L93 Difference]: Finished difference Result 357 states and 394 transitions. [2018-11-07 16:47:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 16:47:42,579 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 273 [2018-11-07 16:47:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:42,580 INFO L225 Difference]: With dead ends: 357 [2018-11-07 16:47:42,580 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 16:47:42,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 498 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 16:47:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2018-11-07 16:47:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-07 16:47:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 296 transitions. [2018-11-07 16:47:42,608 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 296 transitions. Word has length 273 [2018-11-07 16:47:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:42,608 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 296 transitions. [2018-11-07 16:47:42,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 16:47:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 296 transitions. [2018-11-07 16:47:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-07 16:47:42,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:42,610 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 49, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:42,610 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:42,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1535210692, now seen corresponding path program 49 times [2018-11-07 16:47:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:42,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:42,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3432 proven. 4851 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:47:43,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:43,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:43,812 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:43,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:43,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:43,812 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:43,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:43,821 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:43,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3432 proven. 4851 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:47:43,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3432 proven. 4851 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:47:44,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:44,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-11-07 16:47:44,998 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:44,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 16:47:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 16:47:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:44,999 INFO L87 Difference]: Start difference. First operand 278 states and 296 transitions. Second operand 52 states. [2018-11-07 16:47:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:45,209 INFO L93 Difference]: Finished difference Result 376 states and 413 transitions. [2018-11-07 16:47:45,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 16:47:45,210 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 277 [2018-11-07 16:47:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:45,211 INFO L225 Difference]: With dead ends: 376 [2018-11-07 16:47:45,211 INFO L226 Difference]: Without dead ends: 298 [2018-11-07 16:47:45,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 505 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-07 16:47:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 282. [2018-11-07 16:47:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-07 16:47:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 300 transitions. [2018-11-07 16:47:45,247 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 300 transitions. Word has length 277 [2018-11-07 16:47:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:45,248 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 300 transitions. [2018-11-07 16:47:45,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 16:47:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 300 transitions. [2018-11-07 16:47:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-07 16:47:45,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:45,249 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 50, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:45,249 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:45,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1870443506, now seen corresponding path program 50 times [2018-11-07 16:47:45,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:45,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 7852 proven. 1191 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 16:47:46,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:46,740 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:46,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:46,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:46,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:46,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:46,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 16:47:46,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:46,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 5869 proven. 1191 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2018-11-07 16:47:46,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 5869 proven. 1191 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2018-11-07 16:47:47,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:47,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 21, 21] total 53 [2018-11-07 16:47:47,471 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:47,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 16:47:47,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 16:47:47,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 16:47:47,472 INFO L87 Difference]: Start difference. First operand 282 states and 300 transitions. Second operand 53 states. [2018-11-07 16:47:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:48,755 INFO L93 Difference]: Finished difference Result 2696 states and 3340 transitions. [2018-11-07 16:47:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 16:47:48,755 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 281 [2018-11-07 16:47:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:48,768 INFO L225 Difference]: With dead ends: 2696 [2018-11-07 16:47:48,768 INFO L226 Difference]: Without dead ends: 2691 [2018-11-07 16:47:48,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 545 SyntacticMatches, 36 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 16:47:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2018-11-07 16:47:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 414. [2018-11-07 16:47:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-11-07 16:47:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 465 transitions. [2018-11-07 16:47:48,960 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 465 transitions. Word has length 281 [2018-11-07 16:47:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:48,961 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 465 transitions. [2018-11-07 16:47:48,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 16:47:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 465 transitions. [2018-11-07 16:47:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-07 16:47:48,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:48,965 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:48,965 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:48,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2099862750, now seen corresponding path program 51 times [2018-11-07 16:47:48,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:48,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:48,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 10198 proven. 5151 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-11-07 16:47:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:50,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:50,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:50,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:50,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:50,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:50,993 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:51,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:51,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:51,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 20200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:54,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 20200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:55,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:55,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 105, 105] total 109 [2018-11-07 16:47:55,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:55,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-11-07 16:47:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-11-07 16:47:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=11453, Unknown=0, NotChecked=0, Total=11772 [2018-11-07 16:47:55,511 INFO L87 Difference]: Start difference. First operand 414 states and 465 transitions. Second operand 107 states. [2018-11-07 16:48:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:09,947 INFO L93 Difference]: Finished difference Result 5829 states and 7257 transitions. [2018-11-07 16:48:09,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-11-07 16:48:09,948 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 413 [2018-11-07 16:48:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:09,968 INFO L225 Difference]: With dead ends: 5829 [2018-11-07 16:48:09,969 INFO L226 Difference]: Without dead ends: 5616 [2018-11-07 16:48:09,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 771 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=325, Invalid=11665, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 16:48:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2018-11-07 16:48:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 5567. [2018-11-07 16:48:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2018-11-07 16:48:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 5667 transitions. [2018-11-07 16:48:13,875 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 5667 transitions. Word has length 413 [2018-11-07 16:48:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:13,876 INFO L480 AbstractCegarLoop]: Abstraction has 5567 states and 5667 transitions. [2018-11-07 16:48:13,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-11-07 16:48:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 5667 transitions. [2018-11-07 16:48:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-11-07 16:48:13,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:13,879 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:13,879 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:13,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1583456842, now seen corresponding path program 52 times [2018-11-07 16:48:13,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:13,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:13,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 10504 proven. 9901 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-07 16:48:15,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:15,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:15,403 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:15,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:15,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:15,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:15,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:15,413 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:15,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 10504 proven. 9901 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-07 16:48:15,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 10504 proven. 9901 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-07 16:48:17,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:17,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-11-07 16:48:17,762 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:17,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 16:48:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 16:48:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:48:17,764 INFO L87 Difference]: Start difference. First operand 5567 states and 5667 transitions. Second operand 54 states. [2018-11-07 16:48:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:19,057 INFO L93 Difference]: Finished difference Result 5768 states and 5868 transitions. [2018-11-07 16:48:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 16:48:19,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 417 [2018-11-07 16:48:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:19,059 INFO L225 Difference]: With dead ends: 5768 [2018-11-07 16:48:19,059 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:48:19,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 783 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:48:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:48:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:48:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:48:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:48:19,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 417 [2018-11-07 16:48:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:19,069 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:48:19,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 16:48:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:48:19,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:48:19,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:48:25,115 WARN L179 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 1559 DAG size of output: 1042 [2018-11-07 16:48:32,915 WARN L179 SmtUtils]: Spent 7.75 s on a formula simplification. DAG size of input: 887 DAG size of output: 459 [2018-11-07 16:48:32,931 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 16:48:32,931 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:48:32,931 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:48:32,931 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:48:32,931 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:48:32,932 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:48:32,932 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2018-11-07 16:48:32,932 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-07 16:48:32,932 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2018-11-07 16:48:32,932 INFO L425 ceAbstractionStarter]: For program point L15-2(lines 14 22) no Hoare annotation was computed. [2018-11-07 16:48:32,932 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2018-11-07 16:48:32,932 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2018-11-07 16:48:32,933 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 22) no Hoare annotation was computed. [2018-11-07 16:48:32,935 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (let ((.cse13 (<= main_~y~0 40)) (.cse12 (<= 40 main_~y~0)) (.cse28 (<= 31 main_~y~0)) (.cse29 (<= main_~y~0 31)) (.cse23 (<= 28 main_~y~0)) (.cse22 (<= main_~y~0 28)) (.cse8 (<= main_~y~0 6)) (.cse9 (<= 6 main_~y~0)) (.cse3 (<= main_~y~0 15)) (.cse2 (<= 15 main_~y~0)) (.cse32 (<= main_~y~0 36)) (.cse33 (<= 36 main_~y~0)) (.cse42 (<= main_~y~0 13)) (.cse43 (<= 13 main_~y~0)) (.cse30 (<= 8 main_~y~0)) (.cse31 (<= main_~y~0 8)) (.cse16 (<= 44 main_~y~0)) (.cse17 (<= main_~y~0 44)) (.cse18 (<= 37 main_~y~0)) (.cse19 (<= main_~y~0 37)) (.cse36 (<= 0 main_~y~0)) (.cse37 (<= main_~y~0 0)) (.cse20 (<= main_~y~0 4)) (.cse21 (<= 4 main_~y~0)) (.cse45 (<= 47 main_~y~0)) (.cse44 (<= main_~y~0 47)) (.cse55 (<= 48 main_~y~0)) (.cse54 (<= main_~y~0 48)) (.cse70 (<= 25 main_~y~0)) (.cse71 (<= main_~y~0 25)) (.cse40 (<= main_~y~0 10)) (.cse41 (<= 10 main_~y~0)) (.cse67 (<= 26 main_~y~0)) (.cse66 (<= main_~y~0 26)) (.cse68 (<= 35 main_~y~0)) (.cse69 (<= main_~y~0 35)) (.cse48 (<= main_~y~0 16)) (.cse49 (<= 16 main_~y~0)) (.cse63 (<= main_~y~0 32)) (.cse62 (<= 32 main_~y~0)) (.cse50 (<= main_~y~0 21)) (.cse51 (<= 21 main_~y~0)) (.cse34 (<= main_~y~0 45)) (.cse35 (<= 45 main_~y~0)) (.cse52 (<= 38 main_~y~0)) (.cse53 (<= main_~y~0 38)) (.cse76 (<= main_~y~0 9)) (.cse77 (<= 9 main_~y~0)) (.cse78 (<= main_~y~0 3)) (.cse79 (<= 3 main_~y~0)) (.cse38 (<= 30 main_~y~0)) (.cse39 (<= main_~y~0 30)) (.cse82 (<= main_~y~0 42)) (.cse83 (<= 42 main_~y~0)) (.cse15 (<= main_~y~0 14)) (.cse14 (<= 14 main_~y~0)) (.cse4 (<= 46 main_~y~0)) (.cse5 (<= main_~y~0 46)) (.cse0 (<= main_~y~0 2)) (.cse1 (<= 2 main_~y~0)) (.cse64 (<= main_~y~0 12)) (.cse65 (<= 12 main_~y~0)) (.cse58 (<= 19 main_~y~0)) (.cse59 (<= main_~y~0 19)) (.cse75 (<= main_~y~0 24)) (.cse74 (<= 24 main_~y~0)) (.cse88 (<= 22 main_~y~0)) (.cse89 (<= main_~y~0 22)) (.cse57 (<= 11 main_~y~0)) (.cse56 (<= main_~y~0 11)) (.cse25 (<= 17 main_~y~0)) (.cse24 (<= main_~y~0 17)) (.cse90 (<= 34 main_~y~0)) (.cse91 (<= main_~y~0 34)) (.cse84 (<= main_~y~0 41)) (.cse85 (<= 41 main_~y~0)) (.cse81 (<= main_~y~0 27)) (.cse80 (<= 27 main_~y~0)) (.cse6 (<= 1 main_~y~0)) (.cse7 (<= main_~y~0 1)) (.cse26 (<= 33 main_~y~0)) (.cse27 (<= main_~y~0 33)) (.cse87 (<= 5 main_~y~0)) (.cse86 (<= main_~y~0 5)) (.cse46 (<= 23 main_~y~0)) (.cse47 (<= main_~y~0 23)) (.cse73 (<= 29 main_~y~0)) (.cse72 (<= main_~y~0 29)) (.cse60 (<= main_~y~0 7)) (.cse61 (<= 7 main_~y~0)) (.cse96 (<= 43 main_~y~0)) (.cse97 (<= main_~y~0 43)) (.cse92 (<= 18 main_~y~0)) (.cse93 (<= main_~y~0 18)) (.cse94 (<= 20 main_~y~0)) (.cse95 (<= main_~y~0 20)) (.cse10 (<= 49 main_~y~0)) (.cse11 (<= main_~y~0 49)) (.cse99 (<= 39 main_~y~0)) (.cse98 (<= main_~y~0 39))) (or (and (= main_~x~0 2) .cse0 .cse1) (and .cse2 .cse3 (= main_~x~0 15)) (and (= main_~x~0 46) .cse4 .cse5) (and (<= main_~x~0 99) .cse6 .cse7 (<= 99 main_~x~0)) (and (<= 94 main_~x~0) .cse8 (<= main_~x~0 94) .cse9) (and .cse10 (<= main_~x~0 51) (<= 51 main_~x~0) .cse11) (and (= main_~x~0 40) .cse12 .cse13) (and .cse14 (<= main_~x~0 86) .cse15 (<= 86 main_~x~0)) (and .cse16 (<= main_~x~0 56) .cse17 (<= 56 main_~x~0)) (and (<= 50 main_~x~0) (<= main_~y~0 50) (<= main_~x~0 50) (<= 50 main_~y~0)) (and .cse13 (<= main_~x~0 60) (<= 60 main_~x~0) .cse12) (and (= main_~x~0 37) .cse18 .cse19) (and .cse20 .cse21 (= main_~x~0 4)) (and .cse22 (<= 72 main_~x~0) .cse23 (<= main_~x~0 72)) (and .cse24 (<= 83 main_~x~0) (<= main_~x~0 83) .cse25) (and .cse26 (= main_~x~0 33) .cse27) (and .cse28 (<= main_~x~0 69) (<= 69 main_~x~0) .cse29) (and (= main_~x~0 31) .cse28 .cse29) (and (= main_~x~0 8) .cse30 .cse31) (and .cse23 .cse22 (= main_~x~0 28)) (and (= main_~x~0 6) .cse8 .cse9) (and .cse32 .cse33 (= main_~x~0 36)) (and .cse34 (<= main_~x~0 55) (<= 55 main_~x~0) .cse35) (and (= main_~x~0 0) .cse36 .cse37) (and (= main_~x~0 30) .cse38 .cse39) (and .cse40 .cse41 (<= 90 main_~x~0) (<= main_~x~0 90)) (and .cse3 (<= main_~x~0 85) (<= 85 main_~x~0) .cse2) (and .cse42 (<= main_~x~0 87) (<= 87 main_~x~0) .cse43) (and .cse44 (<= 53 main_~x~0) (<= main_~x~0 53) .cse45) (and (<= main_~x~0 64) .cse32 (<= 64 main_~x~0) .cse33) (and (= main_~x~0 13) .cse42 .cse43) (and .cse46 .cse47 (<= 77 main_~x~0) (<= main_~x~0 77)) (and .cse48 .cse49 (= main_~x~0 16)) (and (<= main_~x~0 92) .cse30 .cse31 (<= 92 main_~x~0)) (and (= main_~x~0 44) .cse16 .cse17) (and (<= 63 main_~x~0) .cse18 (<= main_~x~0 63) .cse19) (and (<= main_~x~0 100) .cse36 (<= 100 main_~x~0) .cse37) (and .cse50 .cse51 (= main_~x~0 21)) (and (<= 62 main_~x~0) .cse52 (<= main_~x~0 62) .cse53) (and .cse54 .cse55 (= main_~x~0 48)) (and .cse56 .cse57 (<= 89 main_~x~0) (<= main_~x~0 89)) (and .cse20 .cse21 (<= main_~x~0 96) (<= 96 main_~x~0)) (and .cse58 (= main_~x~0 19) .cse59) (and (<= 93 main_~x~0) .cse60 (<= main_~x~0 93) .cse61) (and (<= 68 main_~x~0) .cse62 (<= main_~x~0 68) .cse63) (and (= main_~x~0 47) .cse45 .cse44) (and (<= main_~x~0 88) (<= 88 main_~x~0) .cse64 .cse65) (and .cse55 .cse54 (<= main_~x~0 52) (<= 52 main_~x~0)) (and (<= 74 main_~x~0) (<= main_~x~0 74) .cse66 .cse67) (and .cse68 .cse69 (<= 65 main_~x~0) (<= main_~x~0 65)) (and .cse70 (<= main_~x~0 75) (<= 75 main_~x~0) .cse71) (and .cse72 .cse73 (= main_~x~0 29)) (and .cse74 .cse75 (= main_~x~0 24)) (and (= main_~x~0 25) .cse70 .cse71) (and .cse40 .cse41 (= main_~x~0 10)) (and (= main_~x~0 26) .cse67 .cse66) (and .cse68 (= main_~x~0 35) .cse69) (and .cse48 (<= 84 main_~x~0) .cse49 (<= main_~x~0 84)) (and .cse63 .cse62 (= main_~x~0 32)) (and (<= main_~x~0 91) (<= 91 main_~x~0) .cse76 .cse77) (and (<= 97 main_~x~0) .cse78 .cse79 (<= main_~x~0 97)) (and .cse80 (<= main_~x~0 73) (<= 73 main_~x~0) .cse81) (and .cse50 (<= main_~x~0 79) (<= 79 main_~x~0) .cse51) (and .cse34 .cse35 (= main_~x~0 45)) (and .cse82 .cse83 (= main_~x~0 42)) (and .cse84 .cse85 (<= 59 main_~x~0) (<= main_~x~0 59)) (and (<= main_~x~0 95) .cse86 .cse87 (<= 95 main_~x~0)) (and .cse52 (= main_~x~0 38) .cse53) (and (= main_~x~0 9) .cse76 .cse77) (and .cse78 .cse79 (= main_~x~0 3)) (and (= main_~x~0 22) .cse88 .cse89) (and (= main_~x~0 34) .cse90 .cse91) (and (<= main_~x~0 70) .cse38 .cse39 (<= 70 main_~x~0)) (and (<= 58 main_~x~0) .cse82 (<= main_~x~0 58) .cse83) (and .cse15 (= main_~x~0 14) .cse14) (and (<= 54 main_~x~0) .cse4 (<= main_~x~0 54) .cse5) (and .cse92 .cse93 (<= 82 main_~x~0) (<= main_~x~0 82)) (and .cse0 (<= main_~x~0 98) .cse1 (<= 98 main_~x~0)) (and .cse64 .cse65 (= main_~x~0 12)) (and (<= main_~x~0 81) .cse58 (<= 81 main_~x~0) .cse59) (and .cse75 (<= 76 main_~x~0) (<= main_~x~0 76) .cse74) (and (<= main_~x~0 78) .cse88 .cse89 (<= 78 main_~x~0)) (and (= main_~x~0 20) .cse94 .cse95) (and .cse57 .cse56 (= main_~x~0 11)) (and .cse25 (= main_~x~0 17) .cse24) (and .cse90 .cse91 (<= 66 main_~x~0) (<= main_~x~0 66)) (and .cse84 (= main_~x~0 41) .cse85) (and (= main_~x~0 27) .cse81 .cse80) (and (= main_~x~0 1) .cse6 .cse7) (and .cse26 .cse27 (<= 67 main_~x~0) (<= main_~x~0 67)) (and (<= 57 main_~x~0) .cse96 (<= main_~x~0 57) .cse97) (and .cse87 (= main_~x~0 5) .cse86) (and .cse46 (= main_~x~0 23) .cse47) (and .cse73 .cse72 (<= 71 main_~x~0) (<= main_~x~0 71)) (and (= main_~x~0 7) .cse60 .cse61) (and (= main_~x~0 43) .cse96 .cse97) (and .cse92 (= main_~x~0 18) .cse93) (and .cse98 (= main_~x~0 39) .cse99) (and .cse94 (<= 80 main_~x~0) (<= main_~x~0 80) .cse95) (and .cse10 (= main_~x~0 49) .cse11) (and (<= 61 main_~x~0) .cse99 .cse98 (<= main_~x~0 61)))) [2018-11-07 16:48:32,936 INFO L421 ceAbstractionStarter]: At program point L14-4(lines 14 22) the Hoare annotation is: (and (<= main_~x~0 100) (<= 100 main_~x~0)) [2018-11-07 16:48:32,936 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 16:48:32,936 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 16:48:32,936 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:48:32,936 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 16:48:32,936 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 16:48:32,936 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:48:32,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:48:32 BoogieIcfgContainer [2018-11-07 16:48:32,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:48:32,976 INFO L168 Benchmark]: Toolchain (without parser) took 142344.43 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 16:48:32,977 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:48:32,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:32,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:48:32,978 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:48:32,978 INFO L168 Benchmark]: RCFGBuilder took 413.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -752.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:32,979 INFO L168 Benchmark]: TraceAbstraction took 141567.25 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 742.9 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -392.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 16:48:32,982 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.80 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 24.99 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 31.25 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 413.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -752.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141567.25 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 742.9 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -392.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x == 2 && y <= 2) && 2 <= y) || ((15 <= y && y <= 15) && x == 15)) || ((x == 46 && 46 <= y) && y <= 46)) || (((x <= 99 && 1 <= y) && y <= 1) && 99 <= x)) || (((94 <= x && y <= 6) && x <= 94) && 6 <= y)) || (((49 <= y && x <= 51) && 51 <= x) && y <= 49)) || ((x == 40 && 40 <= y) && y <= 40)) || (((14 <= y && x <= 86) && y <= 14) && 86 <= x)) || (((44 <= y && x <= 56) && y <= 44) && 56 <= x)) || (((50 <= x && y <= 50) && x <= 50) && 50 <= y)) || (((y <= 40 && x <= 60) && 60 <= x) && 40 <= y)) || ((x == 37 && 37 <= y) && y <= 37)) || ((y <= 4 && 4 <= y) && x == 4)) || (((y <= 28 && 72 <= x) && 28 <= y) && x <= 72)) || (((y <= 17 && 83 <= x) && x <= 83) && 17 <= y)) || ((33 <= y && x == 33) && y <= 33)) || (((31 <= y && x <= 69) && 69 <= x) && y <= 31)) || ((x == 31 && 31 <= y) && y <= 31)) || ((x == 8 && 8 <= y) && y <= 8)) || ((28 <= y && y <= 28) && x == 28)) || ((x == 6 && y <= 6) && 6 <= y)) || ((y <= 36 && 36 <= y) && x == 36)) || (((y <= 45 && x <= 55) && 55 <= x) && 45 <= y)) || ((x == 0 && 0 <= y) && y <= 0)) || ((x == 30 && 30 <= y) && y <= 30)) || (((y <= 10 && 10 <= y) && 90 <= x) && x <= 90)) || (((y <= 15 && x <= 85) && 85 <= x) && 15 <= y)) || (((y <= 13 && x <= 87) && 87 <= x) && 13 <= y)) || (((y <= 47 && 53 <= x) && x <= 53) && 47 <= y)) || (((x <= 64 && y <= 36) && 64 <= x) && 36 <= y)) || ((x == 13 && y <= 13) && 13 <= y)) || (((23 <= y && y <= 23) && 77 <= x) && x <= 77)) || ((y <= 16 && 16 <= y) && x == 16)) || (((x <= 92 && 8 <= y) && y <= 8) && 92 <= x)) || ((x == 44 && 44 <= y) && y <= 44)) || (((63 <= x && 37 <= y) && x <= 63) && y <= 37)) || (((x <= 100 && 0 <= y) && 100 <= x) && y <= 0)) || ((y <= 21 && 21 <= y) && x == 21)) || (((62 <= x && 38 <= y) && x <= 62) && y <= 38)) || ((y <= 48 && 48 <= y) && x == 48)) || (((y <= 11 && 11 <= y) && 89 <= x) && x <= 89)) || (((y <= 4 && 4 <= y) && x <= 96) && 96 <= x)) || ((19 <= y && x == 19) && y <= 19)) || (((93 <= x && y <= 7) && x <= 93) && 7 <= y)) || (((68 <= x && 32 <= y) && x <= 68) && y <= 32)) || ((x == 47 && 47 <= y) && y <= 47)) || (((x <= 88 && 88 <= x) && y <= 12) && 12 <= y)) || (((48 <= y && y <= 48) && x <= 52) && 52 <= x)) || (((74 <= x && x <= 74) && y <= 26) && 26 <= y)) || (((35 <= y && y <= 35) && 65 <= x) && x <= 65)) || (((25 <= y && x <= 75) && 75 <= x) && y <= 25)) || ((y <= 29 && 29 <= y) && x == 29)) || ((24 <= y && y <= 24) && x == 24)) || ((x == 25 && 25 <= y) && y <= 25)) || ((y <= 10 && 10 <= y) && x == 10)) || ((x == 26 && 26 <= y) && y <= 26)) || ((35 <= y && x == 35) && y <= 35)) || (((y <= 16 && 84 <= x) && 16 <= y) && x <= 84)) || ((y <= 32 && 32 <= y) && x == 32)) || (((x <= 91 && 91 <= x) && y <= 9) && 9 <= y)) || (((97 <= x && y <= 3) && 3 <= y) && x <= 97)) || (((27 <= y && x <= 73) && 73 <= x) && y <= 27)) || (((y <= 21 && x <= 79) && 79 <= x) && 21 <= y)) || ((y <= 45 && 45 <= y) && x == 45)) || ((y <= 42 && 42 <= y) && x == 42)) || (((y <= 41 && 41 <= y) && 59 <= x) && x <= 59)) || (((x <= 95 && y <= 5) && 5 <= y) && 95 <= x)) || ((38 <= y && x == 38) && y <= 38)) || ((x == 9 && y <= 9) && 9 <= y)) || ((y <= 3 && 3 <= y) && x == 3)) || ((x == 22 && 22 <= y) && y <= 22)) || ((x == 34 && 34 <= y) && y <= 34)) || (((x <= 70 && 30 <= y) && y <= 30) && 70 <= x)) || (((58 <= x && y <= 42) && x <= 58) && 42 <= y)) || ((y <= 14 && x == 14) && 14 <= y)) || (((54 <= x && 46 <= y) && x <= 54) && y <= 46)) || (((18 <= y && y <= 18) && 82 <= x) && x <= 82)) || (((y <= 2 && x <= 98) && 2 <= y) && 98 <= x)) || ((y <= 12 && 12 <= y) && x == 12)) || (((x <= 81 && 19 <= y) && 81 <= x) && y <= 19)) || (((y <= 24 && 76 <= x) && x <= 76) && 24 <= y)) || (((x <= 78 && 22 <= y) && y <= 22) && 78 <= x)) || ((x == 20 && 20 <= y) && y <= 20)) || ((11 <= y && y <= 11) && x == 11)) || ((17 <= y && x == 17) && y <= 17)) || (((34 <= y && y <= 34) && 66 <= x) && x <= 66)) || ((y <= 41 && x == 41) && 41 <= y)) || ((x == 27 && y <= 27) && 27 <= y)) || ((x == 1 && 1 <= y) && y <= 1)) || (((33 <= y && y <= 33) && 67 <= x) && x <= 67)) || (((57 <= x && 43 <= y) && x <= 57) && y <= 43)) || ((5 <= y && x == 5) && y <= 5)) || ((23 <= y && x == 23) && y <= 23)) || (((29 <= y && y <= 29) && 71 <= x) && x <= 71)) || ((x == 7 && y <= 7) && 7 <= y)) || ((x == 43 && 43 <= y) && y <= 43)) || ((18 <= y && x == 18) && y <= 18)) || ((y <= 39 && x == 39) && 39 <= y)) || (((20 <= y && 80 <= x) && x <= 80) && y <= 20)) || ((49 <= y && x == 49) && y <= 49)) || (((61 <= x && 39 <= y) && y <= 39) && x <= 61) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 141.4s OverallTime, 55 OverallIterations, 102 TraceHistogramMax, 35.9s AutomataDifference, 0.0s DeadEndRemovalTime, 13.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1402 SDtfs, 1076 SDslu, 36580 SDs, 0 SdLazy, 23932 SolverSat, 1386 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18946 GetRequests, 15418 SyntacticMatches, 896 SemanticMatches, 2632 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45963 ImplicationChecksByTransitivity, 82.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5567occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 55 MinimizatonAttempts, 2951 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 62 PreInvPairs, 164 NumberOfFragments, 1176 HoareAnnotationTreeSize, 62 FomulaSimplifications, 50095985 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12095 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 79.7s InterpolantComputationTime, 16860 NumberOfCodeBlocks, 16240 NumberOfCodeBlocksAsserted, 564 NumberOfCheckSat, 25113 ConstructedInterpolants, 0 QuantifiedInterpolants, 13916361 SizeOfPredicates, 69 NumberOfNonLiveVariables, 15740 ConjunctsInSsa, 1584 ConjunctsInUnsatCore, 159 InterpolantComputations, 3 PerfectInterpolantSequences, 318092/604248 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...