java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 15:37:43,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 15:37:43,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 15:37:43,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 15:37:43,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 15:37:43,174 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 15:37:43,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 15:37:43,178 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 15:37:43,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 15:37:43,187 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 15:37:43,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 15:37:43,188 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 15:37:43,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 15:37:43,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 15:37:43,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 15:37:43,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 15:37:43,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 15:37:43,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 15:37:43,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 15:37:43,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 15:37:43,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 15:37:43,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 15:37:43,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 15:37:43,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 15:37:43,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 15:37:43,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 15:37:43,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 15:37:43,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 15:37:43,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 15:37:43,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 15:37:43,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 15:37:43,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 15:37:43,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 15:37:43,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 15:37:43,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 15:37:43,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 15:37:43,230 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 15:37:43,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 15:37:43,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 15:37:43,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 15:37:43,257 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 15:37:43,257 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 15:37:43,257 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 15:37:43,258 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 15:37:43,258 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 15:37:43,258 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 15:37:43,258 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 15:37:43,258 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 15:37:43,259 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 15:37:43,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 15:37:43,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 15:37:43,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 15:37:43,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 15:37:43,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 15:37:43,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 15:37:43,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 15:37:43,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 15:37:43,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 15:37:43,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 15:37:43,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 15:37:43,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 15:37:43,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:37:43,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 15:37:43,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 15:37:43,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 15:37:43,264 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 15:37:43,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 15:37:43,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 15:37:43,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 15:37:43,265 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 15:37:43,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 15:37:43,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 15:37:43,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 15:37:43,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 15:37:43,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 15:37:43,358 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 15:37:43,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-10-27 15:37:43,420 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a801a57a0/b470b72599ba4dfcb9ccddec1e2befa8/FLAG3a1519a2a [2018-10-27 15:37:43,861 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 15:37:43,862 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-10-27 15:37:43,869 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a801a57a0/b470b72599ba4dfcb9ccddec1e2befa8/FLAG3a1519a2a [2018-10-27 15:37:43,885 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a801a57a0/b470b72599ba4dfcb9ccddec1e2befa8 [2018-10-27 15:37:43,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 15:37:43,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 15:37:43,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 15:37:43,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 15:37:43,901 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 15:37:43,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:37:43" (1/1) ... [2018-10-27 15:37:43,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb5b19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:43, skipping insertion in model container [2018-10-27 15:37:43,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:37:43" (1/1) ... [2018-10-27 15:37:43,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 15:37:43,937 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 15:37:44,115 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:37:44,119 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 15:37:44,141 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:37:44,161 INFO L193 MainTranslator]: Completed translation [2018-10-27 15:37:44,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44 WrapperNode [2018-10-27 15:37:44,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 15:37:44,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 15:37:44,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 15:37:44,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 15:37:44,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 15:37:44,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 15:37:44,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 15:37:44,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 15:37:44,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... [2018-10-27 15:37:44,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 15:37:44,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 15:37:44,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 15:37:44,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 15:37:44,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:37:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 15:37:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 15:37:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 15:37:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 15:37:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 15:37:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 15:37:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 15:37:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 15:37:44,753 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 15:37:44,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:37:44 BoogieIcfgContainer [2018-10-27 15:37:44,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 15:37:44,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 15:37:44,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 15:37:44,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 15:37:44,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:37:43" (1/3) ... [2018-10-27 15:37:44,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c23e678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:37:44, skipping insertion in model container [2018-10-27 15:37:44,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:37:44" (2/3) ... [2018-10-27 15:37:44,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c23e678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:37:44, skipping insertion in model container [2018-10-27 15:37:44,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:37:44" (3/3) ... [2018-10-27 15:37:44,762 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call3_true-termination.i [2018-10-27 15:37:44,772 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 15:37:44,780 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 15:37:44,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 15:37:44,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 15:37:44,830 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 15:37:44,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 15:37:44,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 15:37:44,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 15:37:44,830 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 15:37:44,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 15:37:44,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 15:37:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-10-27 15:37:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 15:37:44,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:44,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:44,867 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:44,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash 974464032, now seen corresponding path program 1 times [2018-10-27 15:37:44,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:44,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:44,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:45,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:37:45,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 15:37:45,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:37:45,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 15:37:45,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 15:37:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:37:45,100 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-10-27 15:37:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:45,138 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-10-27 15:37:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 15:37:45,140 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-27 15:37:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:45,149 INFO L225 Difference]: With dead ends: 44 [2018-10-27 15:37:45,149 INFO L226 Difference]: Without dead ends: 21 [2018-10-27 15:37:45,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:37:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-27 15:37:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 15:37:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 15:37:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-27 15:37:45,187 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-10-27 15:37:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:45,188 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-27 15:37:45,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 15:37:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-27 15:37:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 15:37:45,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:45,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:45,190 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:45,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash 984975661, now seen corresponding path program 1 times [2018-10-27 15:37:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:45,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:45,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:37:45,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:37:45,310 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:37:45,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:37:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:37:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:37:45,314 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-10-27 15:37:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:45,414 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-10-27 15:37:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:37:45,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-27 15:37:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:45,418 INFO L225 Difference]: With dead ends: 42 [2018-10-27 15:37:45,418 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 15:37:45,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:37:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 15:37:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-10-27 15:37:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 15:37:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-27 15:37:45,431 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-10-27 15:37:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:45,431 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-27 15:37:45,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:37:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-27 15:37:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 15:37:45,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:45,433 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:45,434 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:45,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1246878611, now seen corresponding path program 1 times [2018-10-27 15:37:45,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:45,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:45,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:45,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:45,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:45,571 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-27 15:37:45,573 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [15], [19], [23], [28], [33], [44], [47], [49], [55], [56], [57], [59] [2018-10-27 15:37:45,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:37:45,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:37:45,803 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:37:46,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:37:46,299 INFO L272 AbstractInterpreter]: Visited 17 different actions 82 times. Merged at 7 different actions 42 times. Widened at 2 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-10-27 15:37:46,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:46,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:37:46,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:46,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:46,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:46,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:37:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:46,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:46,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:46,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:46,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-27 15:37:46,771 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:46,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 15:37:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 15:37:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 15:37:46,773 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2018-10-27 15:37:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:46,911 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-10-27 15:37:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 15:37:46,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-27 15:37:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:46,913 INFO L225 Difference]: With dead ends: 50 [2018-10-27 15:37:46,913 INFO L226 Difference]: Without dead ends: 37 [2018-10-27 15:37:46,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 15:37:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-27 15:37:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2018-10-27 15:37:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 15:37:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-27 15:37:46,920 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-10-27 15:37:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:46,920 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 15:37:46,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 15:37:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-27 15:37:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 15:37:46,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:46,922 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:46,922 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -467456903, now seen corresponding path program 2 times [2018-10-27 15:37:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:46,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:47,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:47,130 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:47,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:47,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:47,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:47,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:37:47,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:37:47,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 15:37:47,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:37:47,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:47,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:47,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:47,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-27 15:37:47,431 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:47,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 15:37:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 15:37:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 15:37:47,432 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-27 15:37:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:47,590 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-10-27 15:37:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:37:47,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 15:37:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:47,593 INFO L225 Difference]: With dead ends: 58 [2018-10-27 15:37:47,593 INFO L226 Difference]: Without dead ends: 45 [2018-10-27 15:37:47,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 15:37:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-27 15:37:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2018-10-27 15:37:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 15:37:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-27 15:37:47,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2018-10-27 15:37:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:47,602 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-27 15:37:47,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 15:37:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-27 15:37:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 15:37:47,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:47,603 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:47,603 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:47,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1323555807, now seen corresponding path program 3 times [2018-10-27 15:37:47,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:47,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:37:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:47,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:47,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:47,746 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:47,747 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:47,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:47,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:47,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:37:47,763 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:37:47,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:37:47,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:37:47,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:47,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:48,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:48,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-27 15:37:48,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:48,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 15:37:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 15:37:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 15:37:48,253 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-10-27 15:37:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:48,457 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-10-27 15:37:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 15:37:48,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-10-27 15:37:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:48,460 INFO L225 Difference]: With dead ends: 66 [2018-10-27 15:37:48,461 INFO L226 Difference]: Without dead ends: 53 [2018-10-27 15:37:48,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 15:37:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-27 15:37:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2018-10-27 15:37:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 15:37:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-27 15:37:48,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-10-27 15:37:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:48,469 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-27 15:37:48,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 15:37:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-27 15:37:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 15:37:48,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:48,470 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:48,470 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:48,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 204884421, now seen corresponding path program 4 times [2018-10-27 15:37:48,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:48,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:48,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:37:48,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:48,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:48,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:48,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:48,661 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:48,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:48,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:48,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:48,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:48,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:37:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:48,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:48,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:48,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:48,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-10-27 15:37:48,936 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:48,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 15:37:48,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 15:37:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 15:37:48,938 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2018-10-27 15:37:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:49,167 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2018-10-27 15:37:49,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 15:37:49,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-27 15:37:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:49,170 INFO L225 Difference]: With dead ends: 74 [2018-10-27 15:37:49,171 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 15:37:49,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 15:37:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 15:37:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2018-10-27 15:37:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 15:37:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-27 15:37:49,183 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-10-27 15:37:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:49,183 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-27 15:37:49,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 15:37:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-27 15:37:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 15:37:49,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:49,184 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:49,185 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:49,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1096493525, now seen corresponding path program 5 times [2018-10-27 15:37:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:49,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:49,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:49,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:49,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:49,486 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:49,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:49,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:49,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:49,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:37:49,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:37:49,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 15:37:49,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:37:49,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:49,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:49,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-10-27 15:37:49,901 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:49,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 15:37:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 15:37:49,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-27 15:37:49,902 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-10-27 15:37:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:50,199 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-10-27 15:37:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 15:37:50,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-27 15:37:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:50,201 INFO L225 Difference]: With dead ends: 82 [2018-10-27 15:37:50,201 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 15:37:50,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-27 15:37:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 15:37:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 33. [2018-10-27 15:37:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 15:37:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-27 15:37:50,209 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-10-27 15:37:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:50,209 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-27 15:37:50,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 15:37:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-10-27 15:37:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 15:37:50,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:50,211 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:50,211 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:50,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1885216495, now seen corresponding path program 6 times [2018-10-27 15:37:50,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:50,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:37:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:50,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:50,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:50,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:50,797 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:50,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:50,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:50,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:50,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:37:50,805 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:37:50,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:37:50,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:37:50,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:50,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:51,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:51,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-10-27 15:37:51,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:51,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 15:37:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 15:37:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 15:37:51,074 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2018-10-27 15:37:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:51,464 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2018-10-27 15:37:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 15:37:51,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-27 15:37:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:51,466 INFO L225 Difference]: With dead ends: 90 [2018-10-27 15:37:51,467 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 15:37:51,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 15:37:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 15:37:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 35. [2018-10-27 15:37:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 15:37:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-27 15:37:51,474 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-10-27 15:37:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:51,475 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-27 15:37:51,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 15:37:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-10-27 15:37:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 15:37:51,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:51,476 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:51,476 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:51,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash 361220727, now seen corresponding path program 7 times [2018-10-27 15:37:51,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:51,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:37:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:51,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:51,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:51,746 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:51,746 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:51,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:51,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:51,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:51,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:51,756 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:37:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:51,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:51,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:52,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:52,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-10-27 15:37:52,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:52,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 15:37:52,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 15:37:52,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-10-27 15:37:52,061 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2018-10-27 15:37:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:52,493 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-10-27 15:37:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 15:37:52,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-10-27 15:37:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:52,498 INFO L225 Difference]: With dead ends: 98 [2018-10-27 15:37:52,498 INFO L226 Difference]: Without dead ends: 85 [2018-10-27 15:37:52,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-10-27 15:37:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-27 15:37:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 37. [2018-10-27 15:37:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 15:37:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-10-27 15:37:52,507 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2018-10-27 15:37:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:52,507 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-10-27 15:37:52,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 15:37:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-10-27 15:37:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 15:37:52,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:52,509 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:52,509 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:52,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1181158819, now seen corresponding path program 8 times [2018-10-27 15:37:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:52,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:52,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:52,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:52,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:52,804 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:52,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:52,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:52,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:52,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:37:52,815 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:37:56,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-27 15:37:56,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:37:56,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:56,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-10-27 15:37:56,764 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:56,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 15:37:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 15:37:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-10-27 15:37:56,766 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 11 states. [2018-10-27 15:37:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:57,312 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2018-10-27 15:37:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 15:37:57,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-10-27 15:37:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:57,314 INFO L225 Difference]: With dead ends: 106 [2018-10-27 15:37:57,314 INFO L226 Difference]: Without dead ends: 93 [2018-10-27 15:37:57,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-10-27 15:37:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-27 15:37:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 39. [2018-10-27 15:37:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 15:37:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-10-27 15:37:57,323 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2018-10-27 15:37:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:57,324 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-27 15:37:57,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 15:37:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-10-27 15:37:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 15:37:57,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:57,325 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:57,326 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:57,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1644185405, now seen corresponding path program 9 times [2018-10-27 15:37:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:57,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:37:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:57,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:58,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:58,048 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:58,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:58,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:37:58,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:37:58,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:37:58,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:37:58,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:58,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:37:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:58,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:37:58,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-10-27 15:37:58,529 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:37:58,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 15:37:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 15:37:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-10-27 15:37:58,530 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2018-10-27 15:37:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:37:59,082 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2018-10-27 15:37:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 15:37:59,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-10-27 15:37:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:37:59,084 INFO L225 Difference]: With dead ends: 114 [2018-10-27 15:37:59,084 INFO L226 Difference]: Without dead ends: 101 [2018-10-27 15:37:59,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-10-27 15:37:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-27 15:37:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2018-10-27 15:37:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 15:37:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-27 15:37:59,093 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-10-27 15:37:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:37:59,094 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-27 15:37:59,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 15:37:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-27 15:37:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 15:37:59,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:37:59,095 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:37:59,095 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:37:59,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:37:59,096 INFO L82 PathProgramCache]: Analyzing trace with hash 63864233, now seen corresponding path program 10 times [2018-10-27 15:37:59,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:37:59,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:59,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:37:59,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:37:59,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:37:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:59,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:59,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:37:59,825 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:37:59,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:37:59,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:37:59,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:37:59,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:37:59,835 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:37:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:37:59,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:37:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:37:59,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:38:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:38:00,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:38:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-10-27 15:38:00,648 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:38:00,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 15:38:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 15:38:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-27 15:38:00,649 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2018-10-27 15:38:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:38:01,722 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2018-10-27 15:38:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 15:38:01,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-10-27 15:38:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:38:01,724 INFO L225 Difference]: With dead ends: 122 [2018-10-27 15:38:01,724 INFO L226 Difference]: Without dead ends: 109 [2018-10-27 15:38:01,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-27 15:38:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-27 15:38:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 43. [2018-10-27 15:38:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-27 15:38:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-10-27 15:38:01,733 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2018-10-27 15:38:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:38:01,733 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-10-27 15:38:01,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 15:38:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-10-27 15:38:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-27 15:38:01,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:38:01,734 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:38:01,734 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:38:01,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:38:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash 822059279, now seen corresponding path program 11 times [2018-10-27 15:38:01,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:38:01,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:38:01,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:38:01,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:38:01,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:38:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:38:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:38:02,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:38:02,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:38:02,585 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:38:02,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:38:02,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:38:02,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:38:02,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:38:02,593 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:38:57,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-27 15:38:57,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:38:57,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:38:57,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 15:38:57,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 15:38:57,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:57,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:57,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:57,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-10-27 15:38:57,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:38:57,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:57,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 15:38:57,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-27 15:38:58,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:38:58,149 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:58,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 15:38:58,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-27 15:38:58,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:38:58,265 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:58,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 15:38:58,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-27 15:38:58,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:38:58,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:58,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 15:38:58,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-27 15:38:58,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:38:58,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:58,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 15:38:58,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-27 15:38:58,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:38:58,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:58,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 15:38:58,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-10-27 15:38:58,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-27 15:38:58,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2018-10-27 15:38:58,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 15:38:58,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:38:58,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:38:58,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2018-10-27 15:38:58,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 15:38:58,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-10-27 15:38:58,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 15:38:58,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:38:58,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 15:38:58,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:38:58,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:58,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:38:58,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:40 [2018-10-27 15:38:58,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-10-27 15:38:58,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:38:58,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 15:38:59,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:38:59,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-10-27 15:38:59,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-10-27 15:38:59,258 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 15:38:59,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:38:59,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:38:59,389 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:116, output treesize:60 [2018-10-27 15:38:59,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-10-27 15:38:59,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:38:59,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-10-27 15:38:59,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 15:38:59,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:38:59,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 15:38:59,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:38:59,758 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 15:38:59,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:38:59,835 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,844 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:38:59,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:38:59,901 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:162, output treesize:65 [2018-10-27 15:39:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:39:00,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:39:01,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-10-27 15:39:02,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 86 [2018-10-27 15:39:02,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 106 [2018-10-27 15:39:02,045 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,046 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,048 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 145 [2018-10-27 15:39:02,076 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,076 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,082 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,084 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,085 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 203 [2018-10-27 15:39:02,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,125 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,127 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,128 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,128 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,131 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,132 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 280 [2018-10-27 15:39:02,188 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,190 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,190 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,210 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,218 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,221 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,223 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 376 [2018-10-27 15:39:02,717 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-10-27 15:39:02,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,740 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,743 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,744 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,745 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,749 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,751 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,757 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,758 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,759 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,798 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,800 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,801 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:39:02,901 INFO L303 Elim1Store]: Index analysis took 179 ms [2018-10-27 15:39:02,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 355 [2018-10-27 15:39:02,938 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 15:39:02,956 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:39:02,956 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 15:39:03,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:39:03,908 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:99, output treesize:91 [2018-10-27 15:39:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:39:04,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:39:04,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2018-10-27 15:39:04,083 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:39:04,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 15:39:04,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 15:39:04,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 15:39:04,085 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 28 states. [2018-10-27 15:39:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:39:06,732 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-10-27 15:39:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 15:39:06,733 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2018-10-27 15:39:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:39:06,734 INFO L225 Difference]: With dead ends: 136 [2018-10-27 15:39:06,734 INFO L226 Difference]: Without dead ends: 123 [2018-10-27 15:39:06,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=450, Invalid=1806, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 15:39:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-27 15:39:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 48. [2018-10-27 15:39:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 15:39:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-27 15:39:06,744 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 38 [2018-10-27 15:39:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:39:06,745 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-27 15:39:06,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 15:39:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-27 15:39:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 15:39:06,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:39:06,746 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:39:06,746 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:39:06,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:39:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash -698788877, now seen corresponding path program 1 times [2018-10-27 15:39:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:39:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:39:06,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:39:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:39:06,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:39:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:39:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-27 15:39:06,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:39:06,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 15:39:06,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:39:06,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 15:39:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 15:39:06,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 15:39:06,996 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 5 states. [2018-10-27 15:39:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:39:07,287 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-10-27 15:39:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:39:07,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-10-27 15:39:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:39:07,288 INFO L225 Difference]: With dead ends: 56 [2018-10-27 15:39:07,288 INFO L226 Difference]: Without dead ends: 54 [2018-10-27 15:39:07,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 15:39:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-27 15:39:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-27 15:39:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 15:39:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-10-27 15:39:07,297 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 40 [2018-10-27 15:39:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:39:07,297 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-10-27 15:39:07,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 15:39:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-10-27 15:39:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 15:39:07,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:39:07,298 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:39:07,298 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:39:07,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:39:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2109295140, now seen corresponding path program 1 times [2018-10-27 15:39:07,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:39:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:39:07,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:39:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:39:07,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:39:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:39:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:39:08,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:39:08,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:39:08,167 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-27 15:39:08,167 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [15], [19], [23], [28], [31], [33], [36], [38], [44], [47], [49], [52], [54], [55], [56], [57], [59], [60] [2018-10-27 15:39:08,169 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:39:08,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:39:08,179 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:39:08,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:39:08,524 INFO L272 AbstractInterpreter]: Visited 23 different actions 213 times. Merged at 11 different actions 93 times. Widened at 3 different actions 11 times. Found 20 fixpoints after 5 different actions. Largest state had 32 variables. [2018-10-27 15:39:08,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:39:08,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:39:08,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:39:08,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:39:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:39:08,574 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:39:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:39:08,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:39:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:39:08,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:39:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:39:09,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:39:09,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-10-27 15:39:09,201 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:39:09,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 15:39:09,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 15:39:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-10-27 15:39:09,202 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2018-10-27 15:39:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:39:10,209 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2018-10-27 15:39:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 15:39:10,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-27 15:39:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:39:10,216 INFO L225 Difference]: With dead ends: 163 [2018-10-27 15:39:10,216 INFO L226 Difference]: Without dead ends: 142 [2018-10-27 15:39:10,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-10-27 15:39:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-27 15:39:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 55. [2018-10-27 15:39:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 15:39:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-27 15:39:10,233 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2018-10-27 15:39:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:39:10,233 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-27 15:39:10,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 15:39:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-10-27 15:39:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 15:39:10,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:39:10,235 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:39:10,235 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:39:10,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:39:10,235 INFO L82 PathProgramCache]: Analyzing trace with hash 236815114, now seen corresponding path program 2 times [2018-10-27 15:39:10,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:39:10,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:39:10,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:39:10,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:39:10,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:39:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:39:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 182 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:39:11,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:39:11,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:39:11,096 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:39:11,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:39:11,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:39:11,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:39:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:39:11,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:40:07,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-10-27 15:40:07,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:40:07,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:40:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:40:07,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:40:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 182 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:40:07,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:40:07,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-10-27 15:40:07,812 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:40:07,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 15:40:07,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 15:40:07,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-10-27 15:40:07,814 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 16 states. [2018-10-27 15:40:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:40:09,052 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2018-10-27 15:40:09,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 15:40:09,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-27 15:40:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:40:09,054 INFO L225 Difference]: With dead ends: 172 [2018-10-27 15:40:09,054 INFO L226 Difference]: Without dead ends: 151 [2018-10-27 15:40:09,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-10-27 15:40:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-27 15:40:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 57. [2018-10-27 15:40:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 15:40:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-10-27 15:40:09,067 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2018-10-27 15:40:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:40:09,068 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-27 15:40:09,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 15:40:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-10-27 15:40:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 15:40:09,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:40:09,069 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:40:09,069 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:40:09,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:40:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 374807152, now seen corresponding path program 3 times [2018-10-27 15:40:09,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:40:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:40:09,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:40:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:40:09,071 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:40:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:40:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:40:09,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:40:09,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:40:09,699 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:40:09,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:40:09,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:40:09,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:40:09,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:40:09,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:40:09,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:40:09,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:40:09,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:40:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:40:09,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:40:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:40:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:40:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-10-27 15:40:10,519 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:40:10,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 15:40:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 15:40:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-10-27 15:40:10,520 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 17 states. [2018-10-27 15:40:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:40:11,705 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2018-10-27 15:40:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 15:40:11,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-27 15:40:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:40:11,708 INFO L225 Difference]: With dead ends: 181 [2018-10-27 15:40:11,708 INFO L226 Difference]: Without dead ends: 160 [2018-10-27 15:40:11,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-10-27 15:40:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-27 15:40:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 59. [2018-10-27 15:40:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 15:40:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-10-27 15:40:11,722 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2018-10-27 15:40:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:40:11,722 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-10-27 15:40:11,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 15:40:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-10-27 15:40:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 15:40:11,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:40:11,723 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:40:11,723 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:40:11,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:40:11,724 INFO L82 PathProgramCache]: Analyzing trace with hash -158830506, now seen corresponding path program 4 times [2018-10-27 15:40:11,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:40:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:40:11,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:40:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:40:11,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:40:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:40:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:40:12,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:40:12,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:40:12,661 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:40:12,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:40:12,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:40:12,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:40:12,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:40:12,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:40:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:40:12,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:40:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:40:12,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:40:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:40:13,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:40:13,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-10-27 15:40:13,599 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:40:13,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 15:40:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 15:40:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 15:40:13,601 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 18 states. [2018-10-27 15:40:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:40:14,774 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2018-10-27 15:40:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 15:40:14,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-10-27 15:40:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:40:14,777 INFO L225 Difference]: With dead ends: 190 [2018-10-27 15:40:14,778 INFO L226 Difference]: Without dead ends: 169 [2018-10-27 15:40:14,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 15:40:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-27 15:40:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 61. [2018-10-27 15:40:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 15:40:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-27 15:40:14,793 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 56 [2018-10-27 15:40:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:40:14,793 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-27 15:40:14,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 15:40:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-27 15:40:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 15:40:14,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:40:14,794 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:40:14,794 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:40:14,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:40:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1883511620, now seen corresponding path program 5 times [2018-10-27 15:40:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:40:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:40:14,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:40:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:40:14,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:40:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:40:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:40:15,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:40:15,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:40:15,247 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:40:15,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:40:15,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:40:15,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:40:15,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:40:15,256 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:41:57,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-10-27 15:41:57,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:41:57,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:41:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:41:57,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:41:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:41:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:41:58,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-10-27 15:41:58,964 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:41:58,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 15:41:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 15:41:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 15:41:58,965 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-10-27 15:42:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:42:00,225 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2018-10-27 15:42:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 15:42:00,225 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-10-27 15:42:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:42:00,227 INFO L225 Difference]: With dead ends: 199 [2018-10-27 15:42:00,227 INFO L226 Difference]: Without dead ends: 178 [2018-10-27 15:42:00,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 15:42:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-27 15:42:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 63. [2018-10-27 15:42:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-27 15:42:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-10-27 15:42:00,246 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2018-10-27 15:42:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:42:00,246 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-10-27 15:42:00,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 15:42:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-10-27 15:42:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 15:42:00,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:42:00,248 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:42:00,248 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:42:00,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:42:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1444685918, now seen corresponding path program 6 times [2018-10-27 15:42:00,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:42:00,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:42:00,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:42:00,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:42:00,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:42:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:42:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 2 proven. 306 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:42:00,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:42:00,689 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:42:00,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:42:00,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:42:00,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:42:00,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:42:00,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:42:00,697 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:42:00,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:42:00,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:42:00,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:42:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:42:00,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:42:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 2 proven. 306 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:42:02,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:42:02,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-10-27 15:42:02,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:42:02,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 15:42:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 15:42:02,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 15:42:02,238 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 20 states. [2018-10-27 15:42:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:42:03,638 INFO L93 Difference]: Finished difference Result 208 states and 264 transitions. [2018-10-27 15:42:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 15:42:03,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-10-27 15:42:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:42:03,641 INFO L225 Difference]: With dead ends: 208 [2018-10-27 15:42:03,641 INFO L226 Difference]: Without dead ends: 187 [2018-10-27 15:42:03,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 15:42:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-27 15:42:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 65. [2018-10-27 15:42:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-27 15:42:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-10-27 15:42:03,657 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 60 [2018-10-27 15:42:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:42:03,658 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-10-27 15:42:03,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 15:42:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-10-27 15:42:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 15:42:03,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:42:03,659 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:42:03,659 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:42:03,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:42:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash -639981304, now seen corresponding path program 7 times [2018-10-27 15:42:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:42:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:42:03,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:42:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:42:03,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:42:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:42:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 2 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:42:04,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:42:04,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:42:04,092 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:42:04,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:42:04,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:42:04,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:42:04,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:42:04,100 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:42:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:42:04,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:42:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:42:04,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:42:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 2 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:42:05,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:42:05,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-10-27 15:42:05,302 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:42:05,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 15:42:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 15:42:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 15:42:05,304 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 21 states. [2018-10-27 15:42:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:42:07,031 INFO L93 Difference]: Finished difference Result 217 states and 276 transitions. [2018-10-27 15:42:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 15:42:07,040 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-10-27 15:42:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:42:07,042 INFO L225 Difference]: With dead ends: 217 [2018-10-27 15:42:07,042 INFO L226 Difference]: Without dead ends: 196 [2018-10-27 15:42:07,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 15:42:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-27 15:42:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 67. [2018-10-27 15:42:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 15:42:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-10-27 15:42:07,064 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-10-27 15:42:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:42:07,065 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-10-27 15:42:07,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 15:42:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-10-27 15:42:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 15:42:07,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:42:07,066 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:42:07,066 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:42:07,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:42:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash -412960530, now seen corresponding path program 8 times [2018-10-27 15:42:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:42:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:42:07,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:42:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:42:07,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:42:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:42:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 2 proven. 380 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:42:07,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:42:07,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:42:07,524 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:42:07,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:42:07,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:42:07,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-27 15:42:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:42:07,533 INFO L288 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