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/array_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:30:42,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:30:42,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:30:42,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:30:42,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:30:42,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:30:42,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:30:42,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:30:42,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:30:42,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:30:42,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:30:42,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:30:42,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:30:42,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:30:42,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:30:42,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:30:42,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:30:42,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:30:42,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:30:42,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:30:42,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:30:42,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:30:42,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:30:42,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:30:42,104 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:30:42,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:30:42,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:30:42,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:30:42,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:30:42,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:30:42,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:30:42,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:30:42,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:30:42,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:30:42,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:30:42,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:30:42,117 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:30:42,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:30:42,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:30:42,144 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:30:42,144 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:30:42,144 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:30:42,146 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:30:42,146 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:30:42,146 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:30:42,146 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:30:42,146 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:30:42,147 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:30:42,147 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:30:42,147 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:30:42,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:30:42,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:30:42,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:30:42,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:30:42,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:30:42,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:30:42,149 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:30:42,151 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:30:42,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:30:42,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:30:42,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:30:42,152 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:30:42,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:30:42,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:30:42,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:30:42,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:30:42,153 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:30:42,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:30:42,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:30:42,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:30:42,154 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:30:42,154 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:30:42,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:30:42,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:30:42,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:30:42,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:30:42,247 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:30:42,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-12 20:30:42,316 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546daab39/702e775f01d0498298968df9eda8f09d/FLAGf42d911b8 [2018-11-12 20:30:42,719 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:30:42,719 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-12 20:30:42,725 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546daab39/702e775f01d0498298968df9eda8f09d/FLAGf42d911b8 [2018-11-12 20:30:42,738 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546daab39/702e775f01d0498298968df9eda8f09d [2018-11-12 20:30:42,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:30:42,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:30:42,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:30:42,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:30:42,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:30:42,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:30:42" (1/1) ... [2018-11-12 20:30:42,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3bd35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:42, skipping insertion in model container [2018-11-12 20:30:42,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:30:42" (1/1) ... [2018-11-12 20:30:42,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:30:42,789 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:30:42,972 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:30:42,976 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:30:42,999 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:30:43,023 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:30:43,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43 WrapperNode [2018-11-12 20:30:43,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:30:43,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:30:43,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:30:43,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:30:43,035 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:30:43" (1/1) ... [2018-11-12 20:30:43,045 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:30:43" (1/1) ... [2018-11-12 20:30:43,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:30:43,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:30:43,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:30:43,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:30:43,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (1/1) ... [2018-11-12 20:30:43,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:30:43,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:30:43,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:30:43,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:30:43,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (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:30:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:30:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:30:43,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:30:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:30:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:30:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:30:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:30:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:30:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:30:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:30:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:30:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:30:43,656 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:30:43,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:30:43 BoogieIcfgContainer [2018-11-12 20:30:43,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:30:43,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:30:43,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:30:43,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:30:43,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:30:42" (1/3) ... [2018-11-12 20:30:43,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55de8e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:30:43, skipping insertion in model container [2018-11-12 20:30:43,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:43" (2/3) ... [2018-11-12 20:30:43,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55de8e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:30:43, skipping insertion in model container [2018-11-12 20:30:43,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:30:43" (3/3) ... [2018-11-12 20:30:43,673 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call2_true-termination.i [2018-11-12 20:30:43,693 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:30:43,702 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:30:43,720 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:30:43,751 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:30:43,751 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:30:43,752 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:30:43,752 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:30:43,752 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:30:43,752 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:30:43,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:30:43,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:30:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-12 20:30:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:30:43,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:43,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:43,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:43,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash -173834890, now seen corresponding path program 1 times [2018-11-12 20:30:43,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:43,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:43,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:43,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:43,917 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:30:43,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:30:43,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:30:43,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:43,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:30:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:30:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:30:43,939 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-12 20:30:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:43,964 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-12 20:30:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:30:43,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-12 20:30:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:43,972 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:30:43,972 INFO L226 Difference]: Without dead ends: 15 [2018-11-12 20:30:43,975 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:30:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-12 20:30:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-12 20:30:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-12 20:30:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-12 20:30:44,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-12 20:30:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:44,011 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-12 20:30:44,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:30:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-12 20:30:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:30:44,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:44,013 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:44,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:44,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:44,014 INFO L82 PathProgramCache]: Analyzing trace with hash -737648989, now seen corresponding path program 1 times [2018-11-12 20:30:44,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:44,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:44,092 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:30:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:30:44,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:30:44,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:44,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:30:44,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:30:44,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:30:44,096 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2018-11-12 20:30:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:44,142 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-12 20:30:44,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:30:44,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-12 20:30:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:44,144 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:30:44,144 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:30:44,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:30:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:30:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-12 20:30:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-12 20:30:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-12 20:30:44,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-12 20:30:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:44,151 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-12 20:30:44,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:30:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-12 20:30:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:30:44,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:44,152 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:44,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:44,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1154592614, now seen corresponding path program 1 times [2018-11-12 20:30:44,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:44,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:44,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:44,241 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:30:44,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:44,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:44,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-12 20:30:44,250 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [35], [36], [37], [39] [2018-11-12 20:30:44,295 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:44,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:44,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:44,557 INFO L272 AbstractInterpreter]: Visited 15 different actions 35 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 159 root evaluator evaluations with a maximum evaluation depth of 5. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-12 20:30:44,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:44,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:44,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:44,583 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:30:44,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:44,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:44,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:44,686 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:30:44,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:44,759 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:30:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:44,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-12 20:30:44,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:44,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:30:44,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:30:44,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:30:44,782 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-11-12 20:30:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:44,877 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-12 20:30:44,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:30:44,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-12 20:30:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:44,879 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:30:44,879 INFO L226 Difference]: Without dead ends: 21 [2018-11-12 20:30:44,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:30:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-12 20:30:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-12 20:30:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:30:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-12 20:30:44,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-11-12 20:30:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:44,886 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-12 20:30:44,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:30:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-12 20:30:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:30:44,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:44,888 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:44,888 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:44,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1276704957, now seen corresponding path program 2 times [2018-11-12 20:30:44,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:44,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:44,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:44,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:44,984 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:30:44,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:44,984 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:30:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:45,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:45,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:30:45,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:45,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:45,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-12 20:30:45,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:45,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:30:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:30:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:30:45,534 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 6 states. [2018-11-12 20:30:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:45,605 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-12 20:30:45,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:30:45,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-12 20:30:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:45,610 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:30:45,610 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:30:45,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:30:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:30:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-12 20:30:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-12 20:30:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-12 20:30:45,617 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-11-12 20:30:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:45,617 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-12 20:30:45,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:30:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-12 20:30:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-12 20:30:45,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:45,619 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:45,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:45,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1288215558, now seen corresponding path program 3 times [2018-11-12 20:30:45,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:45,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:45,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:45,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:45,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:45,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:45,740 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:45,740 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:30:45,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:45,740 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:30:45,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:45,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:45,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:45,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:45,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:45,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:45,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-12 20:30:45,976 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:45,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:30:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:30:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:30:45,977 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-11-12 20:30:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:46,023 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-12 20:30:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:30:46,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-12 20:30:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:46,027 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:30:46,027 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:30:46,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:30:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:30:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-12 20:30:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:30:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-12 20:30:46,033 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-11-12 20:30:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:46,033 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-12 20:30:46,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:30:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-12 20:30:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:30:46,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:46,035 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:46,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:46,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash -603146269, now seen corresponding path program 4 times [2018-11-12 20:30:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:46,226 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:46,226 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:30:46,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,227 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:30:46,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:46,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:46,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:46,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-12 20:30:46,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:46,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:30:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:30:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:30:46,502 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 8 states. [2018-11-12 20:30:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:46,592 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-12 20:30:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:30:46,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-12 20:30:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:46,594 INFO L225 Difference]: With dead ends: 36 [2018-11-12 20:30:46,594 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:30:46,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:30:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:30:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-12 20:30:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-12 20:30:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-12 20:30:46,600 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-11-12 20:30:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-12 20:30:46,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:30:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-12 20:30:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 20:30:46,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:46,602 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:46,602 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:46,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1388548262, now seen corresponding path program 5 times [2018-11-12 20:30:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:46,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:46,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:46,799 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:46,799 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:30:46,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,800 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:30:46,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:46,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:46,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:30:46,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:46,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:47,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:47,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:47,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-12 20:30:47,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:47,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:30:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:30:47,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:30:47,300 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2018-11-12 20:30:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:47,437 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-12 20:30:47,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:30:47,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-12 20:30:47,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:47,439 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:30:47,439 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:30:47,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:30:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:30:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-12 20:30:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-12 20:30:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-12 20:30:47,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-11-12 20:30:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:47,445 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-12 20:30:47,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:30:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-12 20:30:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:30:47,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:47,447 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:47,447 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:47,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:47,448 INFO L82 PathProgramCache]: Analyzing trace with hash -317493117, now seen corresponding path program 6 times [2018-11-12 20:30:47,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:47,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:47,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:47,598 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:47,598 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:30:47,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:47,599 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:30:47,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:47,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:47,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:47,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:47,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:47,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:47,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:47,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-12 20:30:47,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:47,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:30:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:30:47,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:30:47,938 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2018-11-12 20:30:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:47,984 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-12 20:30:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:30:47,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-12 20:30:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:47,988 INFO L225 Difference]: With dead ends: 42 [2018-11-12 20:30:47,988 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:30:47,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:30:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:30:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-12 20:30:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-12 20:30:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-12 20:30:47,994 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-11-12 20:30:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:47,994 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-12 20:30:47,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:30:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-12 20:30:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-12 20:30:47,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:47,995 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:47,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:47,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 174289594, now seen corresponding path program 7 times [2018-11-12 20:30:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:47,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:48,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:48,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:48,136 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:48,136 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:30:48,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:48,137 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:30:48,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:48,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:48,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:48,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:48,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:48,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-12 20:30:48,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:48,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:30:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:30:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:30:48,775 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 11 states. [2018-11-12 20:30:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:48,852 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-12 20:30:48,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:30:48,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-12 20:30:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:48,861 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:30:48,862 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:30:48,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:30:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:30:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-12 20:30:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:30:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-12 20:30:48,867 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-11-12 20:30:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:48,867 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-12 20:30:48,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:30:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-12 20:30:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:30:48,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:48,869 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:48,869 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:48,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash 739586339, now seen corresponding path program 8 times [2018-11-12 20:30:48,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:48,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:49,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:49,044 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:49,045 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:30:49,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,045 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:30:49,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:49,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:49,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:30:49,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:49,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:49,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:49,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:49,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-12 20:30:49,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:49,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:30:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:30:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:30:49,334 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 12 states. [2018-11-12 20:30:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:49,467 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-12 20:30:49,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:30:49,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-12 20:30:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:49,470 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:30:49,470 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:30:49,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:30:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:30:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-12 20:30:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-12 20:30:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-12 20:30:49,476 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-11-12 20:30:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:49,477 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-12 20:30:49,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:30:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-12 20:30:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-12 20:30:49,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:49,478 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:49,479 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:49,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:49,479 INFO L82 PathProgramCache]: Analyzing trace with hash 928149018, now seen corresponding path program 9 times [2018-11-12 20:30:49,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:49,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:49,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:50,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:50,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:50,254 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:50,254 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:30:50,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:50,254 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:30:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:50,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:50,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:50,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:50,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:50,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:50,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:50,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-12 20:30:50,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:50,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:30:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:30:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:30:50,578 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2018-11-12 20:30:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:50,639 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-12 20:30:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:30:50,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-12 20:30:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:50,641 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:30:50,641 INFO L226 Difference]: Without dead ends: 45 [2018-11-12 20:30:50,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:30:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-12 20:30:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-12 20:30:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:30:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-12 20:30:50,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-11-12 20:30:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:50,647 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-12 20:30:50,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:30:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-12 20:30:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:30:50,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:50,648 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:50,648 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:50,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 581695939, now seen corresponding path program 10 times [2018-11-12 20:30:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:50,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:50,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:50,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:50,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:50,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:50,883 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:30:50,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:50,884 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:30:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:50,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:50,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:50,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:51,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:51,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-12 20:30:51,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:51,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:30:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:30:51,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:30:51,408 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 14 states. [2018-11-12 20:30:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:51,458 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-12 20:30:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:30:51,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-12 20:30:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:51,462 INFO L225 Difference]: With dead ends: 54 [2018-11-12 20:30:51,463 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:30:51,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:30:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:30:51,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-12 20:30:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:30:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-12 20:30:51,468 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-11-12 20:30:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:51,469 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-12 20:30:51,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:30:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-12 20:30:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-12 20:30:51,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:51,470 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:51,471 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:51,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 204431738, now seen corresponding path program 11 times [2018-11-12 20:30:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:51,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:51,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:51,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:51,751 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:51,751 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:30:51,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,751 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:30:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:51,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:51,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:30:51,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:51,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:51,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:52,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:52,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-12 20:30:52,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:52,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:30:52,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:30:52,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:30:52,303 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 15 states. [2018-11-12 20:30:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:52,377 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-12 20:30:52,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:30:52,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-12 20:30:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:52,379 INFO L225 Difference]: With dead ends: 57 [2018-11-12 20:30:52,379 INFO L226 Difference]: Without dead ends: 51 [2018-11-12 20:30:52,380 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:30:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-12 20:30:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-12 20:30:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-12 20:30:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-12 20:30:52,386 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-11-12 20:30:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:52,386 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-12 20:30:52,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:30:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-12 20:30:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:30:52,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:52,387 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:52,387 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:52,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1056033379, now seen corresponding path program 12 times [2018-11-12 20:30:52,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:52,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:52,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:53,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:53,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:53,379 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:53,380 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:30:53,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:53,380 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:30:53,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:53,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:53,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:53,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:53,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:53,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:53,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:53,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-12 20:30:53,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:53,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:30:53,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:30:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:30:53,778 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 16 states. [2018-11-12 20:30:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:53,838 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-12 20:30:53,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:30:53,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-12 20:30:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:53,840 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:30:53,840 INFO L226 Difference]: Without dead ends: 54 [2018-11-12 20:30:53,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:30:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-12 20:30:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-12 20:30:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-12 20:30:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-12 20:30:53,846 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-11-12 20:30:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:53,847 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-12 20:30:53,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:30:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-12 20:30:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-12 20:30:53,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:53,848 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:53,848 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:53,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash 748702938, now seen corresponding path program 13 times [2018-11-12 20:30:53,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:53,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:53,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:53,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:54,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:54,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:54,125 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:30:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:54,126 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:30:54,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:54,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:54,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:54,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:54,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:54,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-12 20:30:54,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:54,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:30:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:30:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:30:54,782 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 17 states. [2018-11-12 20:30:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:54,923 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-12 20:30:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:30:54,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-12 20:30:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:54,924 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:30:54,925 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:30:54,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:30:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:30:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-12 20:30:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-12 20:30:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-12 20:30:54,931 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-11-12 20:30:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:54,931 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-12 20:30:54,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:30:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-12 20:30:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-12 20:30:54,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:54,932 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:54,933 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:54,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1937810179, now seen corresponding path program 14 times [2018-11-12 20:30:54,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:54,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:54,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:55,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:55,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:55,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:55,218 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:30:55,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:55,219 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:30:55,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:55,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:55,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:30:55,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:55,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:55,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:56,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:56,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-12 20:30:56,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:56,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:30:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:30:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:30:56,016 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 18 states. [2018-11-12 20:30:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:56,095 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-12 20:30:56,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:30:56,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-12 20:30:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:56,096 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:30:56,096 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:30:56,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:30:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:30:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-12 20:30:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-12 20:30:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-12 20:30:56,103 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-11-12 20:30:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:56,103 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-12 20:30:56,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:30:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-12 20:30:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-12 20:30:56,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:56,104 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:56,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:56,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1741369402, now seen corresponding path program 15 times [2018-11-12 20:30:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:56,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:56,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:56,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:56,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:56,404 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:56,404 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:30:56,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:56,404 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:30:56,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:30:56,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:30:56,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:30:56,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:56,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:56,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:57,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:57,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-12 20:30:57,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:57,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:30:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:30:57,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:30:57,720 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 19 states. [2018-11-12 20:30:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:57,843 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-12 20:30:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:30:57,846 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-12 20:30:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:57,847 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:30:57,847 INFO L226 Difference]: Without dead ends: 63 [2018-11-12 20:30:57,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:30:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-12 20:30:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-12 20:30:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-12 20:30:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-12 20:30:57,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-11-12 20:30:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:57,852 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-12 20:30:57,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:30:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-12 20:30:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-12 20:30:57,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:57,854 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:57,854 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:57,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash -680361053, now seen corresponding path program 16 times [2018-11-12 20:30:57,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:57,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:57,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:57,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:57,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:58,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:58,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:58,079 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:58,079 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:30:58,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:58,079 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:30:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:58,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:58,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:58,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:59,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-12 20:30:59,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:59,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:30:59,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:30:59,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:30:59,144 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 20 states. [2018-11-12 20:30:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:59,235 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-12 20:30:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:30:59,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-12 20:30:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:59,236 INFO L225 Difference]: With dead ends: 72 [2018-11-12 20:30:59,236 INFO L226 Difference]: Without dead ends: 66 [2018-11-12 20:30:59,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:30:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-12 20:30:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-12 20:30:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-12 20:30:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-12 20:30:59,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-11-12 20:30:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:59,243 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-12 20:30:59,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:30:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-12 20:30:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-12 20:30:59,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:59,245 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:59,245 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:59,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 408292250, now seen corresponding path program 17 times [2018-11-12 20:30:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:59,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:59,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:59,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:59,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:59,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:59,528 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:30:59,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:59,528 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:30:59,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:59,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:00,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:31:00,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:00,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:00,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:00,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-12 20:31:00,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:00,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:31:00,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:31:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:31:00,571 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 21 states. [2018-11-12 20:31:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:00,645 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-12 20:31:00,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:31:00,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-12 20:31:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:00,646 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:31:00,646 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:31:00,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:31:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:31:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-12 20:31:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-12 20:31:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-12 20:31:00,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-11-12 20:31:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:00,652 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-12 20:31:00,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:31:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-12 20:31:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-12 20:31:00,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:00,654 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:00,654 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:00,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:00,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1180789827, now seen corresponding path program 18 times [2018-11-12 20:31:00,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:00,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:00,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:01,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:01,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:01,176 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:01,177 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:31:01,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:01,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:01,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:01,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:01,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:01,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:01,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:01,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:01,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:01,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-12 20:31:01,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:01,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:31:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:31:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:31:01,722 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 22 states. [2018-11-12 20:31:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:01,804 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-12 20:31:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:31:01,805 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-12 20:31:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:01,806 INFO L225 Difference]: With dead ends: 78 [2018-11-12 20:31:01,806 INFO L226 Difference]: Without dead ends: 72 [2018-11-12 20:31:01,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:31:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-12 20:31:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-12 20:31:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-12 20:31:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-12 20:31:01,811 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-11-12 20:31:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:01,811 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-12 20:31:01,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:31:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-12 20:31:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-12 20:31:01,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:01,813 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:01,813 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:01,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2073633030, now seen corresponding path program 19 times [2018-11-12 20:31:01,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:01,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:01,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:01,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:01,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:02,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:02,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:02,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:02,308 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:31:02,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:02,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:02,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:02,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:02,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:02,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:02,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:02,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-12 20:31:02,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:02,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:31:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:31:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:31:02,985 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 23 states. [2018-11-12 20:31:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:03,095 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-12 20:31:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:31:03,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-12 20:31:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:03,097 INFO L225 Difference]: With dead ends: 81 [2018-11-12 20:31:03,097 INFO L226 Difference]: Without dead ends: 75 [2018-11-12 20:31:03,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:31:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-12 20:31:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-12 20:31:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-12 20:31:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-11-12 20:31:03,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-11-12 20:31:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:03,102 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-11-12 20:31:03,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:31:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-12 20:31:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-12 20:31:03,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:03,103 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:03,103 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:03,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash 6773987, now seen corresponding path program 20 times [2018-11-12 20:31:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:03,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:03,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:03,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:03,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:03,500 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:03,500 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:31:03,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:03,500 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:03,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:03,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:04,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:31:04,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:04,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:04,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:04,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:04,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-12 20:31:04,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:04,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:31:04,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:31:04,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:31:04,645 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 24 states. [2018-11-12 20:31:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:04,821 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-12 20:31:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:31:04,823 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-12 20:31:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:04,824 INFO L225 Difference]: With dead ends: 84 [2018-11-12 20:31:04,824 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:31:04,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:31:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:31:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-12 20:31:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:31:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-12 20:31:04,829 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-11-12 20:31:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:04,830 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-12 20:31:04,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:31:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-12 20:31:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-12 20:31:04,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:04,831 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:04,831 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:04,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1034136154, now seen corresponding path program 21 times [2018-11-12 20:31:04,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:04,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:04,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:05,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:05,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:05,276 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:05,276 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:31:05,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:05,276 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:05,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:05,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:05,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:05,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:05,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:05,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:05,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:05,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-12 20:31:05,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:05,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:31:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:31:05,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:31:05,994 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 25 states. [2018-11-12 20:31:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:06,081 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-12 20:31:06,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:31:06,082 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-12 20:31:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:06,083 INFO L225 Difference]: With dead ends: 87 [2018-11-12 20:31:06,083 INFO L226 Difference]: Without dead ends: 81 [2018-11-12 20:31:06,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:31:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-12 20:31:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-12 20:31:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-12 20:31:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-11-12 20:31:06,087 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-11-12 20:31:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:06,088 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-11-12 20:31:06,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:31:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-12 20:31:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:31:06,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:06,088 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:06,089 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:06,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1243501955, now seen corresponding path program 22 times [2018-11-12 20:31:06,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:06,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:06,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:06,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:06,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:06,551 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:06,551 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:31:06,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:06,551 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:06,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:06,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:06,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:06,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:07,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:07,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-12 20:31:07,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:07,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:31:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:31:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:31:07,606 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-11-12 20:31:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:07,766 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-12 20:31:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:31:07,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-12 20:31:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:07,768 INFO L225 Difference]: With dead ends: 90 [2018-11-12 20:31:07,768 INFO L226 Difference]: Without dead ends: 84 [2018-11-12 20:31:07,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:31:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-12 20:31:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-12 20:31:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-12 20:31:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-12 20:31:07,773 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-11-12 20:31:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:07,773 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-12 20:31:07,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:31:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-12 20:31:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-12 20:31:07,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:07,774 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:07,774 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:07,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2127401542, now seen corresponding path program 23 times [2018-11-12 20:31:07,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:07,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:07,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:08,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:08,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:08,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:08,144 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:31:08,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:08,144 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:08,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:09,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:31:09,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:09,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:09,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:10,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:10,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-12 20:31:10,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:10,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:31:10,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:31:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:31:10,615 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 27 states. [2018-11-12 20:31:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:10,726 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-12 20:31:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:31:10,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-12 20:31:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:10,728 INFO L225 Difference]: With dead ends: 93 [2018-11-12 20:31:10,728 INFO L226 Difference]: Without dead ends: 87 [2018-11-12 20:31:10,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:31:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-12 20:31:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-12 20:31:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-12 20:31:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-11-12 20:31:10,732 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-11-12 20:31:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:10,732 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-11-12 20:31:10,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:31:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-12 20:31:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-12 20:31:10,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:10,733 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:10,733 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:10,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash 211834403, now seen corresponding path program 24 times [2018-11-12 20:31:10,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:10,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:10,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:11,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:11,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:11,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:11,100 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:31:11,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:11,100 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:11,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:11,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:11,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:11,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:11,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:11,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:11,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-12 20:31:11,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:11,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:31:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:31:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:31:11,945 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 28 states. [2018-11-12 20:31:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:12,097 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-12 20:31:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:31:12,098 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-12 20:31:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:12,099 INFO L225 Difference]: With dead ends: 96 [2018-11-12 20:31:12,099 INFO L226 Difference]: Without dead ends: 90 [2018-11-12 20:31:12,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:31:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-12 20:31:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-12 20:31:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:31:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-12 20:31:12,103 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-11-12 20:31:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:12,104 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-12 20:31:12,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:31:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-12 20:31:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-12 20:31:12,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:12,105 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:12,105 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:12,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1749472998, now seen corresponding path program 25 times [2018-11-12 20:31:12,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:12,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:12,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:12,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:12,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:13,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:13,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:13,655 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:13,655 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:31:13,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:13,656 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:13,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:13,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:13,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:13,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-12 20:31:15,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:15,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:31:15,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:31:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:31:15,015 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 29 states. [2018-11-12 20:31:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:15,105 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-12 20:31:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:31:15,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-12 20:31:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:15,107 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:31:15,107 INFO L226 Difference]: Without dead ends: 93 [2018-11-12 20:31:15,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:31:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-12 20:31:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-12 20:31:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-12 20:31:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-11-12 20:31:15,113 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-11-12 20:31:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:15,113 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-11-12 20:31:15,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:31:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-12 20:31:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-12 20:31:15,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:15,114 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:15,114 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:15,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1971805891, now seen corresponding path program 26 times [2018-11-12 20:31:15,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:15,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:15,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:15,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:15,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:15,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:15,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:15,476 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:15,476 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:31:15,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:15,476 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:15,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:15,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:18,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:31:18,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:18,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:18,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:19,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:19,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-12 20:31:19,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:19,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:31:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:31:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:31:19,598 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 30 states. [2018-11-12 20:31:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:19,700 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-12 20:31:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:31:19,700 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-12 20:31:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:19,701 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:31:19,701 INFO L226 Difference]: Without dead ends: 96 [2018-11-12 20:31:19,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:31:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-12 20:31:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-12 20:31:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-12 20:31:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-12 20:31:19,707 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-11-12 20:31:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:19,707 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-12 20:31:19,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:31:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-12 20:31:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-12 20:31:19,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:19,708 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:19,708 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:19,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash 895343738, now seen corresponding path program 27 times [2018-11-12 20:31:19,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:19,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:19,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:19,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:19,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:20,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:20,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:20,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:20,143 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:31:20,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:20,143 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:20,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:20,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:20,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:20,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:20,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:20,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:21,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:21,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-12 20:31:21,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:21,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:31:21,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:31:21,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:31:21,397 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 31 states. [2018-11-12 20:31:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:21,588 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-12 20:31:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:31:21,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-12 20:31:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:21,590 INFO L225 Difference]: With dead ends: 105 [2018-11-12 20:31:21,590 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:31:21,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:31:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:31:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-12 20:31:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-12 20:31:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-11-12 20:31:21,594 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-11-12 20:31:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:21,594 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-11-12 20:31:21,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:31:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-11-12 20:31:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-12 20:31:21,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:21,597 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:21,597 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:21,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1762824349, now seen corresponding path program 28 times [2018-11-12 20:31:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:21,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:21,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:21,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:22,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:22,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:22,806 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:22,806 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:31:22,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:22,807 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:22,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:22,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:22,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:23,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:23,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-12 20:31:23,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:23,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:31:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:31:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:31:23,801 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 32 states. [2018-11-12 20:31:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:23,926 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-12 20:31:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:31:23,927 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-12 20:31:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:23,928 INFO L225 Difference]: With dead ends: 108 [2018-11-12 20:31:23,928 INFO L226 Difference]: Without dead ends: 102 [2018-11-12 20:31:23,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:31:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-12 20:31:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-12 20:31:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-12 20:31:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-12 20:31:23,933 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-11-12 20:31:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:23,934 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-12 20:31:23,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:31:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-12 20:31:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-12 20:31:23,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:23,935 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:23,935 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:23,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash -641300518, now seen corresponding path program 29 times [2018-11-12 20:31:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:23,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:23,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:24,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:24,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:24,383 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:24,384 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:31:24,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:24,384 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:24,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:24,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:32,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:31:32,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:32,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:32,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:33,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:33,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-12 20:31:33,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:33,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:31:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:31:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:31:33,811 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 33 states. [2018-11-12 20:31:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:34,012 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-12 20:31:34,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:31:34,012 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-12 20:31:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:34,014 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:31:34,014 INFO L226 Difference]: Without dead ends: 105 [2018-11-12 20:31:34,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:31:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-12 20:31:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-12 20:31:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-12 20:31:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-11-12 20:31:34,018 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-11-12 20:31:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:34,019 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-11-12 20:31:34,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:31:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-12 20:31:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 20:31:34,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:34,020 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:34,020 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:34,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash 124553219, now seen corresponding path program 30 times [2018-11-12 20:31:34,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:34,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:34,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:34,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:34,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:34,707 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:34,707 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:31:34,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:34,708 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:34,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:34,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:34,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:34,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:34,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:35,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:35,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-12 20:31:35,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:35,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:31:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:31:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:31:35,841 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 34 states. [2018-11-12 20:31:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:35,970 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-12 20:31:35,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:31:35,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-12 20:31:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:35,972 INFO L225 Difference]: With dead ends: 114 [2018-11-12 20:31:35,972 INFO L226 Difference]: Without dead ends: 108 [2018-11-12 20:31:35,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:31:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-12 20:31:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-12 20:31:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-12 20:31:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-12 20:31:35,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-11-12 20:31:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:35,977 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-12 20:31:35,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:31:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-12 20:31:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-12 20:31:35,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:35,978 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:35,978 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:35,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash 806955834, now seen corresponding path program 31 times [2018-11-12 20:31:35,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:35,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:35,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:35,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:36,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:36,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:36,520 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:36,520 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:31:36,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:36,520 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:36,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:36,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:36,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:36,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:37,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:37,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-12 20:31:37,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:37,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:31:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:31:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:31:37,911 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 35 states. [2018-11-12 20:31:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:38,079 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-12 20:31:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:31:38,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-12 20:31:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:38,081 INFO L225 Difference]: With dead ends: 117 [2018-11-12 20:31:38,081 INFO L226 Difference]: Without dead ends: 111 [2018-11-12 20:31:38,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:31:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-12 20:31:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-12 20:31:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-12 20:31:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-11-12 20:31:38,086 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-11-12 20:31:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:38,087 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-11-12 20:31:38,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:31:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-11-12 20:31:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:31:38,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:38,088 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:38,088 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2111919965, now seen corresponding path program 32 times [2018-11-12 20:31:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:38,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:38,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:38,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:38,674 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:38,674 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:31:38,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:38,674 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:38,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:38,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:51,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-12 20:31:51,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:51,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:51,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:52,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:52,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-12 20:31:52,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:52,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:31:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:31:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:31:52,842 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 36 states. [2018-11-12 20:31:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:52,979 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-12 20:31:52,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:31:52,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-12 20:31:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:52,980 INFO L225 Difference]: With dead ends: 120 [2018-11-12 20:31:52,981 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:31:52,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:31:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:31:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-12 20:31:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-12 20:31:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-11-12 20:31:52,985 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-11-12 20:31:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:52,985 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-11-12 20:31:52,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:31:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-11-12 20:31:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-12 20:31:52,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:52,987 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:52,987 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:52,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1861994138, now seen corresponding path program 33 times [2018-11-12 20:31:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:52,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:52,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:53,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:53,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:53,601 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:53,601 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:31:53,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:53,601 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:53,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:53,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:53,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:53,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:53,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:53,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:55,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:55,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-11-12 20:31:55,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:55,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:31:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:31:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:31:55,652 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 37 states. [2018-11-12 20:31:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:55,793 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-12 20:31:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:31:55,793 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-12 20:31:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:55,794 INFO L225 Difference]: With dead ends: 123 [2018-11-12 20:31:55,795 INFO L226 Difference]: Without dead ends: 117 [2018-11-12 20:31:55,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:31:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-12 20:31:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-12 20:31:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-12 20:31:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-11-12 20:31:55,798 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-11-12 20:31:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:55,798 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-11-12 20:31:55,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:31:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-11-12 20:31:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-12 20:31:55,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:55,799 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:55,799 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:55,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2036477629, now seen corresponding path program 34 times [2018-11-12 20:31:55,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:55,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:55,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:56,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:56,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:56,477 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:56,477 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:31:56,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:56,477 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:56,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:56,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:56,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:57,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:57,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-12 20:31:57,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:57,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:31:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:31:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:31:57,936 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 38 states. [2018-11-12 20:31:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:58,080 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-11-12 20:31:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:31:58,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-12 20:31:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:58,081 INFO L225 Difference]: With dead ends: 126 [2018-11-12 20:31:58,082 INFO L226 Difference]: Without dead ends: 120 [2018-11-12 20:31:58,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:31:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-12 20:31:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-12 20:31:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-12 20:31:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-11-12 20:31:58,086 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-11-12 20:31:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:58,087 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-11-12 20:31:58,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:31:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-11-12 20:31:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-12 20:31:58,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:58,088 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:58,088 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:58,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1198237190, now seen corresponding path program 35 times [2018-11-12 20:31:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:58,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:58,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:58,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:58,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:58,882 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:58,882 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:31:58,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:58,882 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:58,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:15,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:32:15,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:15,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:15,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:16,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-12 20:32:16,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:16,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:32:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:32:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:32:16,902 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 39 states. [2018-11-12 20:32:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:17,063 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-12 20:32:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:32:17,066 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-12 20:32:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:17,066 INFO L225 Difference]: With dead ends: 129 [2018-11-12 20:32:17,067 INFO L226 Difference]: Without dead ends: 123 [2018-11-12 20:32:17,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:32:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-12 20:32:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-12 20:32:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-12 20:32:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-11-12 20:32:17,071 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-11-12 20:32:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:17,071 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-11-12 20:32:17,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:32:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-11-12 20:32:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 20:32:17,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:17,072 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:17,072 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:17,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash -117177885, now seen corresponding path program 36 times [2018-11-12 20:32:17,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:17,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:17,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:17,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:17,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:17,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:17,981 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:17,981 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:17,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:17,981 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:17,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:17,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:18,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:18,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:18,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:18,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:20,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:20,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-12 20:32:20,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:20,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:32:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:32:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:32:20,143 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 40 states. [2018-11-12 20:32:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:20,341 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-11-12 20:32:20,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:32:20,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-12 20:32:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:20,350 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:32:20,350 INFO L226 Difference]: Without dead ends: 126 [2018-11-12 20:32:20,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:32:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-12 20:32:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-12 20:32:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-12 20:32:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-11-12 20:32:20,355 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-11-12 20:32:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:20,355 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-11-12 20:32:20,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:32:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-11-12 20:32:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-12 20:32:20,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:20,356 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:20,356 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:20,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2055791962, now seen corresponding path program 37 times [2018-11-12 20:32:20,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:20,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:20,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:21,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:21,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:21,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:21,788 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:21,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:21,788 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:21,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:21,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:21,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:23,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:23,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-12 20:32:23,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:23,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:32:23,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:32:23,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:32:23,492 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 41 states. [2018-11-12 20:32:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:24,479 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-12 20:32:24,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:32:24,480 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-12 20:32:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:24,481 INFO L225 Difference]: With dead ends: 135 [2018-11-12 20:32:24,481 INFO L226 Difference]: Without dead ends: 129 [2018-11-12 20:32:24,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:32:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-12 20:32:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-12 20:32:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:32:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-11-12 20:32:24,486 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-11-12 20:32:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-11-12 20:32:24,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:32:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-11-12 20:32:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 20:32:24,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:24,488 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:24,488 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:24,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1041548669, now seen corresponding path program 38 times [2018-11-12 20:32:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:24,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:24,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:25,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:25,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:25,399 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:25,399 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:25,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:25,399 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:25,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:25,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:06,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-12 20:33:06,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:06,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:06,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:07,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:07,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-12 20:33:07,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:07,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:33:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:33:07,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:33:07,974 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 42 states. [2018-11-12 20:33:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:08,197 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-11-12 20:33:08,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:33:08,198 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-12 20:33:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:08,199 INFO L225 Difference]: With dead ends: 138 [2018-11-12 20:33:08,199 INFO L226 Difference]: Without dead ends: 132 [2018-11-12 20:33:08,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:33:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-12 20:33:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-12 20:33:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-12 20:33:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-11-12 20:33:08,204 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-11-12 20:33:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:08,204 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-11-12 20:33:08,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:33:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-11-12 20:33:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 20:33:08,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:08,205 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:08,206 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:08,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash -838899526, now seen corresponding path program 39 times [2018-11-12 20:33:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:08,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:08,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:08,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:08,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:08,933 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:08,933 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:08,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:08,933 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:08,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:08,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:08,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:08,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:08,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:09,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:11,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:11,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-11-12 20:33:11,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:11,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:33:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:33:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:33:11,126 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 43 states. [2018-11-12 20:33:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:11,376 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-11-12 20:33:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:33:11,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-12 20:33:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:11,378 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:33:11,378 INFO L226 Difference]: Without dead ends: 135 [2018-11-12 20:33:11,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:33:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-12 20:33:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-12 20:33:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-12 20:33:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-11-12 20:33:11,383 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-11-12 20:33:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:11,384 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-11-12 20:33:11,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:33:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-11-12 20:33:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-12 20:33:11,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:11,385 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:11,385 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:11,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1852668707, now seen corresponding path program 40 times [2018-11-12 20:33:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:11,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:11,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:12,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:12,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:12,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:12,851 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:12,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:12,852 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:12,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:12,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:12,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:12,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:14,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:14,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-12 20:33:14,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:14,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:33:14,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:33:14,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:33:14,710 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 44 states. [2018-11-12 20:33:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:15,213 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-11-12 20:33:15,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:33:15,214 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-12 20:33:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:15,216 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:33:15,216 INFO L226 Difference]: Without dead ends: 138 [2018-11-12 20:33:15,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:33:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-12 20:33:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-12 20:33:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-12 20:33:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-11-12 20:33:15,222 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-11-12 20:33:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-11-12 20:33:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:33:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-11-12 20:33:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-12 20:33:15,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:15,223 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:15,223 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:15,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -677518310, now seen corresponding path program 41 times [2018-11-12 20:33:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:15,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:16,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:16,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:16,117 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:16,117 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,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:16,117 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:16,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:16,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:58,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-12 20:33:58,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:58,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:58,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:00,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:00,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-12 20:34:00,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:00,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:34:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:34:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:34:00,733 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 45 states. [2018-11-12 20:34:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:00,912 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-12 20:34:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:34:00,914 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-12 20:34:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:00,915 INFO L225 Difference]: With dead ends: 147 [2018-11-12 20:34:00,915 INFO L226 Difference]: Without dead ends: 141 [2018-11-12 20:34:00,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:34:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-12 20:34:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-11-12 20:34:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-12 20:34:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-11-12 20:34:00,919 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-11-12 20:34:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:00,919 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-11-12 20:34:00,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:34:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-11-12 20:34:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 20:34:00,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:00,921 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:00,921 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:00,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash -802896957, now seen corresponding path program 42 times [2018-11-12 20:34:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:00,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:00,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:00,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:00,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:01,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:01,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:01,924 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:01,924 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:34:01,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:01,924 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:01,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:01,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:01,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:01,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:01,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:02,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:04,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:04,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-11-12 20:34:04,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:04,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:34:04,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:34:04,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-12 20:34:04,088 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 46 states. [2018-11-12 20:34:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:04,266 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-11-12 20:34:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:34:04,267 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-12 20:34:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:04,267 INFO L225 Difference]: With dead ends: 150 [2018-11-12 20:34:04,268 INFO L226 Difference]: Without dead ends: 144 [2018-11-12 20:34:04,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-12 20:34:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-12 20:34:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-12 20:34:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-12 20:34:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-11-12 20:34:04,271 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-11-12 20:34:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:04,272 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-11-12 20:34:04,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:34:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-11-12 20:34:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 20:34:04,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:04,273 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:04,273 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:04,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash 663377786, now seen corresponding path program 43 times [2018-11-12 20:34:04,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:04,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:04,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:05,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:05,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:05,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:05,140 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:34:05,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:05,140 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:05,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:05,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:05,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:07,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:07,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-12 20:34:07,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:07,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:34:07,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:34:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:34:07,499 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 47 states. [2018-11-12 20:34:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:07,663 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-11-12 20:34:07,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:34:07,663 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-12 20:34:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:07,665 INFO L225 Difference]: With dead ends: 153 [2018-11-12 20:34:07,665 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 20:34:07,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:34:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 20:34:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-11-12 20:34:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-12 20:34:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-11-12 20:34:07,669 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-11-12 20:34:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:07,669 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-11-12 20:34:07,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:34:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-11-12 20:34:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-12 20:34:07,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:07,670 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:07,670 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:07,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1658121117, now seen corresponding path program 44 times [2018-11-12 20:34:07,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:07,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:07,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:07,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:08,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:08,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:08,677 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:08,677 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:34:08,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:08,677 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:08,686 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