java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:32:44,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:32:44,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:32:44,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:32:44,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:32:44,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:32:44,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:32:44,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:32:44,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:32:44,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:32:44,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:32:44,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:32:44,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:32:44,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:32:44,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:32:44,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:32:44,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:32:44,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:32:44,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:32:44,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:32:44,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:32:44,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:32:44,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:32:44,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:32:44,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:32:44,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:32:44,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:32:44,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:32:44,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:32:44,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:32:44,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:32:44,921 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:32:44,921 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:32:44,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:32:44,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:32:44,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:32:44,925 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:32:44,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:32:44,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:32:44,953 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:32:44,953 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:32:44,953 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:32:44,954 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:32:44,955 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:32:44,955 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:32:44,955 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:32:44,955 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:32:44,956 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:32:44,956 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:32:44,956 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:32:44,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:32:44,958 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:32:44,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:32:44,958 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:32:44,958 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:32:44,958 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:32:44,959 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:32:44,960 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:32:44,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:32:44,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:32:44,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:32:44,961 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:32:44,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:32:44,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:32:44,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:32:44,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:32:44,962 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:32:44,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:32:44,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:32:44,962 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:32:44,962 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:32:44,963 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:32:45,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:32:45,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:32:45,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:32:45,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:32:45,063 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:32:45,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-12 20:32:45,116 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c115493/bf12d991a599449ab81e4a5d704f363e/FLAGd899dd459 [2018-11-12 20:32:45,617 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:32:45,618 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-12 20:32:45,625 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c115493/bf12d991a599449ab81e4a5d704f363e/FLAGd899dd459 [2018-11-12 20:32:45,641 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c115493/bf12d991a599449ab81e4a5d704f363e [2018-11-12 20:32:45,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:32:45,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:32:45,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:32:45,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:32:45,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:32:45,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:32:45" (1/1) ... [2018-11-12 20:32:45,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0ab5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:45, skipping insertion in model container [2018-11-12 20:32:45,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:32:45" (1/1) ... [2018-11-12 20:32:45,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:32:45,707 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:32:45,957 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:32:45,962 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:32:45,981 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:32:45,999 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:32:46,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46 WrapperNode [2018-11-12 20:32:46,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:32:46,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:32:46,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:32:46,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:32:46,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:32:46,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:32:46,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:32:46,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:32:46,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... [2018-11-12 20:32:46,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:32:46,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:32:46,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:32:46,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:32:46,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:32:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:32:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:32:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:32:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:32:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:32:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:32:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:32:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:32:46,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:32:46,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:32:46 BoogieIcfgContainer [2018-11-12 20:32:46,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:32:46,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:32:46,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:32:46,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:32:46,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:32:45" (1/3) ... [2018-11-12 20:32:46,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e0bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:32:46, skipping insertion in model container [2018-11-12 20:32:46,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:46" (2/3) ... [2018-11-12 20:32:46,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e0bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:32:46, skipping insertion in model container [2018-11-12 20:32:46,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:32:46" (3/3) ... [2018-11-12 20:32:46,391 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call1.i [2018-11-12 20:32:46,400 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:32:46,406 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:32:46,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:32:46,458 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:32:46,458 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:32:46,458 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:32:46,459 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:32:46,459 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:32:46,459 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:32:46,459 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:32:46,459 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:32:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-12 20:32:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:32:46,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:46,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:46,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:46,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-12 20:32:46,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:32:46,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:32:46,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:32:46,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:32:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:32:46,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:32:46,632 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-12 20:32:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:46,654 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-12 20:32:46,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:32:46,656 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:32:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:46,665 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:32:46,665 INFO L226 Difference]: Without dead ends: 12 [2018-11-12 20:32:46,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:32:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-12 20:32:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-12 20:32:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-12 20:32:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-12 20:32:46,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-12 20:32:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:46,704 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-12 20:32:46,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:32:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-12 20:32:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:32:46,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:46,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:46,706 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:46,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-12 20:32:46,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:46,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:46,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:32:46,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:32:46,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:32:46,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:32:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:32:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:32:46,856 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-12 20:32:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:46,891 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-12 20:32:46,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:32:46,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:32:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:46,896 INFO L225 Difference]: With dead ends: 19 [2018-11-12 20:32:46,896 INFO L226 Difference]: Without dead ends: 14 [2018-11-12 20:32:46,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:32:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-12 20:32:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-12 20:32:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-12 20:32:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-12 20:32:46,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-12 20:32:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:46,903 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-12 20:32:46,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:32:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-12 20:32:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:32:46,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:46,905 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:46,905 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:46,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-12 20:32:46,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:46,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:46,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:46,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:47,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:47,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-12 20:32:47,145 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-12 20:32:47,176 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:32:47,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:32:47,276 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:32:47,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:32:47,496 INFO L272 AbstractInterpreter]: Visited 12 different actions 60 times. Merged at 3 different actions 22 times. Widened at 1 different actions 4 times. Performed 138 root evaluator evaluations with a maximum evaluation depth of 6. Performed 138 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-12 20:32:47,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:47,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:32:47,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:47,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:47,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:47,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:47,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:47,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:47,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:32:47,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:47,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:32:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:32:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:32:47,744 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-12 20:32:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:47,772 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-12 20:32:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:32:47,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-12 20:32:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:47,774 INFO L225 Difference]: With dead ends: 21 [2018-11-12 20:32:47,774 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:32:47,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:32:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:32:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-12 20:32:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-12 20:32:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-12 20:32:47,779 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-12 20:32:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:47,780 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-12 20:32:47,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:32:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-12 20:32:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:32:47,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:47,781 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:47,781 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-12 20:32:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:47,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:47,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:47,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:47,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:47,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:47,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:47,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:47,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:48,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:32:48,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:48,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:48,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:48,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:48,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 20:32:48,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:48,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:32:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:32:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:32:48,278 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-12 20:32:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:48,317 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-12 20:32:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:32:48,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-12 20:32:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:48,319 INFO L225 Difference]: With dead ends: 23 [2018-11-12 20:32:48,319 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:32:48,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:32:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:32:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:32:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:32:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-12 20:32:48,329 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-12 20:32:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:48,329 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-12 20:32:48,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:32:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-12 20:32:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:32:48,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:48,330 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:48,331 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:48,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-12 20:32:48,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:48,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:48,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:48,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:48,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:48,453 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:48,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:48,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:48,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:48,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:48,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:48,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:48,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:48,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:48,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:48,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:48,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-12 20:32:48,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:48,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:32:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:32:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:32:48,763 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-12 20:32:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:48,800 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-12 20:32:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:32:48,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-12 20:32:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:48,802 INFO L225 Difference]: With dead ends: 25 [2018-11-12 20:32:48,802 INFO L226 Difference]: Without dead ends: 20 [2018-11-12 20:32:48,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:32:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-12 20:32:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-12 20:32:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:32:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-12 20:32:48,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-12 20:32:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:48,808 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-12 20:32:48,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:32:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-12 20:32:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:32:48,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:48,809 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:48,809 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:48,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-12 20:32:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:48,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:48,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:48,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:48,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:48,978 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:48,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:48,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:48,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:48,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:48,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:49,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:49,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:49,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:32:49,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:32:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:32:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:32:49,610 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-12 20:32:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:49,686 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-12 20:32:49,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:32:49,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-12 20:32:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:49,688 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:32:49,688 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:32:49,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:32:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:32:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-12 20:32:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-12 20:32:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-12 20:32:49,694 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-12 20:32:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:49,694 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-12 20:32:49,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:32:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-12 20:32:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:32:49,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:49,696 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:49,696 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:49,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-12 20:32:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:49,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:49,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:49,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:49,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:49,949 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:49,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:49,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:49,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:49,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:50,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:32:50,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:50,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:50,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:50,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:50,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-12 20:32:50,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:50,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:32:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:32:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:32:50,315 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-12 20:32:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:50,387 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-12 20:32:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:32:50,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-12 20:32:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:50,389 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:32:50,389 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:32:50,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:32:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:32:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-12 20:32:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:32:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-12 20:32:50,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-12 20:32:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:50,395 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-12 20:32:50,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:32:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-12 20:32:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:32:50,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:50,396 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:50,397 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:50,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-12 20:32:50,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:50,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:50,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:50,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:50,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:50,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:50,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:50,686 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:50,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:50,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:50,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:50,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:50,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:50,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:50,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:50,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:50,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:51,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:51,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:32:51,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:51,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:32:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:32:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:32:51,008 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-12 20:32:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:51,088 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-12 20:32:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:32:51,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-12 20:32:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:51,092 INFO L225 Difference]: With dead ends: 31 [2018-11-12 20:32:51,092 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:32:51,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:32:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:32:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-12 20:32:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:32:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-12 20:32:51,098 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-12 20:32:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:51,099 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-12 20:32:51,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:32:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-12 20:32:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:32:51,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:51,100 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:51,100 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:51,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:51,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-12 20:32:51,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:51,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:51,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:51,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:51,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:51,371 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:51,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:51,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:51,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:51,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:51,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:51,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:51,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-12 20:32:51,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:51,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:32:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:32:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:32:51,691 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-12 20:32:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:51,928 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-12 20:32:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:32:51,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-12 20:32:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:51,934 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:32:51,934 INFO L226 Difference]: Without dead ends: 28 [2018-11-12 20:32:51,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:32:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-12 20:32:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-12 20:32:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:32:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-12 20:32:51,940 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-12 20:32:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:51,940 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-12 20:32:51,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:32:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-12 20:32:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:32:51,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:51,941 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:51,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:51,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-12 20:32:51,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:51,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:51,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:52,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:52,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:52,103 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:52,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:52,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:52,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:52,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:52,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:15,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:33:15,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:15,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:15,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:15,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:15,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-12 20:33:15,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:15,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:33:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:33:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:33:15,896 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-12 20:33:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:16,018 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-12 20:33:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:33:16,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-12 20:33:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:16,019 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:33:16,020 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:33:16,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:33:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:33:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-12 20:33:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:33:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-12 20:33:16,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-12 20:33:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:16,026 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-12 20:33:16,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:33:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-12 20:33:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:33:16,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:16,028 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:16,028 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:16,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-12 20:33:16,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:16,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:16,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:16,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:16,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:16,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:16,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:16,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:16,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:16,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:16,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:16,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:16,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:16,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:16,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:16,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:16,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-12 20:33:16,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:16,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:33:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:33:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:33:16,541 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-12 20:33:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:16,712 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-12 20:33:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:33:16,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-12 20:33:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:16,714 INFO L225 Difference]: With dead ends: 37 [2018-11-12 20:33:16,714 INFO L226 Difference]: Without dead ends: 32 [2018-11-12 20:33:16,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:33:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-12 20:33:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-12 20:33:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-12 20:33:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-12 20:33:16,720 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-12 20:33:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-12 20:33:16,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:33:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-12 20:33:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:33:16,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:16,722 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:16,722 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:16,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-12 20:33:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:16,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:16,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:16,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:16,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:16,986 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:16,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:16,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:16,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:16,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:17,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:17,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:17,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:17,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-12 20:33:17,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:17,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:33:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:33:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:33:17,469 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-12 20:33:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:17,584 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-12 20:33:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:33:17,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-12 20:33:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:17,586 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:33:17,586 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:33:17,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:33:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:33:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-12 20:33:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-12 20:33:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-12 20:33:17,593 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-12 20:33:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:17,593 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-12 20:33:17,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:33:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-12 20:33:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-12 20:33:17,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:17,595 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:17,595 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:17,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-12 20:33:17,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:17,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:17,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:17,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:17,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:17,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:17,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:17,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:18,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:18,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:34,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:34:34,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:34,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:35,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:01,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:01,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-12 20:35:01,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:01,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:35:01,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:35:01,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=448, Unknown=9, NotChecked=0, Total=650 [2018-11-12 20:35:01,461 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-12 20:35:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:01,655 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-12 20:35:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:35:01,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-12 20:35:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:01,659 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:35:01,659 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:35:01,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=193, Invalid=448, Unknown=9, NotChecked=0, Total=650 [2018-11-12 20:35:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:35:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-12 20:35:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:35:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-12 20:35:01,664 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-12 20:35:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:01,664 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-12 20:35:01,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:35:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-12 20:35:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:35:01,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:01,665 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:01,665 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:01,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-12 20:35:01,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:01,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:01,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:02,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:02,081 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:02,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:02,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:02,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:02,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:02,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:02,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:02,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:02,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:02,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:35:02,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:02,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:35:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:35:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:35:02,839 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-12 20:35:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:03,016 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-12 20:35:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:35:03,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-12 20:35:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:03,017 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:35:03,018 INFO L226 Difference]: Without dead ends: 38 [2018-11-12 20:35:03,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:35:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-12 20:35:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-12 20:35:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:35:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-12 20:35:03,024 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-12 20:35:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:03,024 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-12 20:35:03,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:35:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-12 20:35:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:35:03,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:03,025 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:03,025 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:03,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-12 20:35:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:03,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:03,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:03,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:03,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:03,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:03,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:03,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:03,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:03,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:03,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:03,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:04,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:04,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:35:04,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:04,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:35:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:35:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:35:04,279 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-12 20:35:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:04,444 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-12 20:35:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:35:04,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-12 20:35:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:04,446 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:35:04,446 INFO L226 Difference]: Without dead ends: 40 [2018-11-12 20:35:04,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:35:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-12 20:35:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-12 20:35:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-12 20:35:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-12 20:35:04,453 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-12 20:35:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-12 20:35:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:35:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-12 20:35:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:35:04,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:04,454 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:04,454 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:04,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-12 20:35:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:04,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:04,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:04,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:05,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:05,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:05,025 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:05,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:05,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:05,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:05,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:05,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:16,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:35:16,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:16,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:19,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:19,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 35 [2018-11-12 20:35:19,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:19,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:35:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:35:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:35:19,365 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-12 20:35:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:19,558 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-12 20:35:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:35:19,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-12 20:35:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:19,560 INFO L225 Difference]: With dead ends: 47 [2018-11-12 20:35:19,560 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:35:19,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:35:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:35:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-12 20:35:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:35:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-12 20:35:19,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-12 20:35:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:19,567 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-12 20:35:19,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:35:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-12 20:35:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:35:19,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:19,568 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:19,568 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:19,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-12 20:35:19,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:19,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:19,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:19,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:19,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:19,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:19,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:19,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:19,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:19,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:19,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:19,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:19,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:19,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:19,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:20,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:20,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-12 20:35:20,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:20,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:35:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:35:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:35:20,608 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-12 20:35:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:20,821 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-12 20:35:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:35:20,822 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-12 20:35:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:20,823 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:35:20,823 INFO L226 Difference]: Without dead ends: 44 [2018-11-12 20:35:20,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:35:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-12 20:35:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-12 20:35:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:35:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-12 20:35:20,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-12 20:35:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:20,830 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-12 20:35:20,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:35:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-12 20:35:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:35:20,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:20,831 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:20,831 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:20,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-12 20:35:20,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:20,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:20,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:20,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:20,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:21,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:21,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:21,208 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:21,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:21,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:21,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:21,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:21,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:21,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-12 20:35:21,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:21,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:35:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:35:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:35:21,932 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-12 20:35:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:22,277 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-12 20:35:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:35:22,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-12 20:35:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:22,279 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:35:22,279 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:35:22,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:35:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:35:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-12 20:35:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-12 20:35:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-12 20:35:22,286 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-12 20:35:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:22,287 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-12 20:35:22,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:35:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-12 20:35:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:35:22,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:22,288 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:22,288 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:22,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-12 20:35:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:22,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:22,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:22,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:22,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:22,724 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:22,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:22,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:22,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:22,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:22,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown