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/loops/vogal_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 15:28:37,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 15:28:37,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 15:28:37,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 15:28:37,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 15:28:37,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 15:28:37,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 15:28:37,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 15:28:37,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 15:28:37,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 15:28:37,881 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 15:28:37,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 15:28:37,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 15:28:37,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 15:28:37,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 15:28:37,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 15:28:37,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 15:28:37,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 15:28:37,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 15:28:37,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 15:28:37,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 15:28:37,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 15:28:37,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 15:28:37,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 15:28:37,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 15:28:37,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 15:28:37,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 15:28:37,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 15:28:37,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 15:28:37,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 15:28:37,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 15:28:37,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 15:28:37,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 15:28:37,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 15:28:37,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 15:28:37,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 15:28:37,925 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:28:37,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 15:28:37,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 15:28:37,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 15:28:37,960 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 15:28:37,960 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 15:28:37,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 15:28:37,961 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 15:28:37,961 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 15:28:37,961 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 15:28:37,961 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 15:28:37,961 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 15:28:37,962 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 15:28:37,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 15:28:37,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 15:28:37,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 15:28:37,963 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 15:28:37,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 15:28:37,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 15:28:37,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 15:28:37,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 15:28:37,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 15:28:37,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 15:28:37,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 15:28:37,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 15:28:37,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:28:37,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 15:28:37,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 15:28:37,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 15:28:37,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 15:28:37,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 15:28:37,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 15:28:37,966 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 15:28:37,966 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 15:28:37,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 15:28:38,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 15:28:38,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 15:28:38,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 15:28:38,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 15:28:38,031 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 15:28:38,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/vogal_false-unreach-call.i [2018-10-27 15:28:38,096 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eee0dab4b/91363b98805a4029af89495356800493/FLAGffdacc6a0 [2018-10-27 15:28:38,612 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 15:28:38,613 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_false-unreach-call.i [2018-10-27 15:28:38,622 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eee0dab4b/91363b98805a4029af89495356800493/FLAGffdacc6a0 [2018-10-27 15:28:38,642 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eee0dab4b/91363b98805a4029af89495356800493 [2018-10-27 15:28:38,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 15:28:38,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 15:28:38,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 15:28:38,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 15:28:38,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 15:28:38,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:28:38" (1/1) ... [2018-10-27 15:28:38,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c656ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:38, skipping insertion in model container [2018-10-27 15:28:38,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:28:38" (1/1) ... [2018-10-27 15:28:38,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 15:28:38,701 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 15:28:38,921 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:28:38,926 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 15:28:38,971 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:28:39,006 INFO L193 MainTranslator]: Completed translation [2018-10-27 15:28:39,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39 WrapperNode [2018-10-27 15:28:39,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 15:28:39,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 15:28:39,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 15:28:39,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 15:28:39,019 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:28:39" (1/1) ... [2018-10-27 15:28:39,033 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:28:39" (1/1) ... [2018-10-27 15:28:39,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 15:28:39,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 15:28:39,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 15:28:39,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 15:28:39,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (1/1) ... [2018-10-27 15:28:39,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 15:28:39,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 15:28:39,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 15:28:39,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 15:28:39,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (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:28:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 15:28:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 15:28:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 15:28:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 15:28:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 15:28:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 15:28:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 15:28:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 15:28:39,984 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 15:28:39,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:28:39 BoogieIcfgContainer [2018-10-27 15:28:39,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 15:28:39,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 15:28:39,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 15:28:39,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 15:28:39,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:28:38" (1/3) ... [2018-10-27 15:28:39,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc909cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:28:39, skipping insertion in model container [2018-10-27 15:28:39,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:39" (2/3) ... [2018-10-27 15:28:39,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc909cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:28:39, skipping insertion in model container [2018-10-27 15:28:39,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:28:39" (3/3) ... [2018-10-27 15:28:39,994 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_false-unreach-call.i [2018-10-27 15:28:40,004 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 15:28:40,014 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 15:28:40,033 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 15:28:40,073 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 15:28:40,073 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 15:28:40,073 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 15:28:40,074 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 15:28:40,074 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 15:28:40,074 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 15:28:40,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 15:28:40,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 15:28:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-27 15:28:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 15:28:40,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:40,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:40,101 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:40,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:40,108 INFO L82 PathProgramCache]: Analyzing trace with hash 423919587, now seen corresponding path program 1 times [2018-10-27 15:28:40,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:40,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:40,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:40,266 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:28:40,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:28:40,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 15:28:40,269 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:40,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 15:28:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 15:28:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:28:40,293 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-10-27 15:28:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:40,316 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2018-10-27 15:28:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 15:28:40,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-27 15:28:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:40,326 INFO L225 Difference]: With dead ends: 75 [2018-10-27 15:28:40,327 INFO L226 Difference]: Without dead ends: 35 [2018-10-27 15:28:40,332 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:28:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-27 15:28:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 15:28:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 15:28:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-10-27 15:28:40,369 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 17 [2018-10-27 15:28:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:40,370 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-10-27 15:28:40,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 15:28:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-10-27 15:28:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 15:28:40,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:40,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:40,372 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:40,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1156330617, now seen corresponding path program 1 times [2018-10-27 15:28:40,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:40,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:40,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:40,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:40,580 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:28:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:28:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:28:40,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:40,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:28:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:28:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:28:40,586 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 3 states. [2018-10-27 15:28:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:40,840 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-10-27 15:28:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:28:40,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 15:28:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:40,844 INFO L225 Difference]: With dead ends: 81 [2018-10-27 15:28:40,844 INFO L226 Difference]: Without dead ends: 55 [2018-10-27 15:28:40,845 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:28:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-27 15:28:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2018-10-27 15:28:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 15:28:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-10-27 15:28:40,854 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 23 [2018-10-27 15:28:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:40,855 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-27 15:28:40,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:28:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-10-27 15:28:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 15:28:40,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:40,856 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:40,856 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:40,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1223778650, now seen corresponding path program 1 times [2018-10-27 15:28:40,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:40,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:40,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:41,087 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:28:41,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:41,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:41,089 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-27 15:28:41,091 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [35], [39], [42], [68], [72], [74], [77], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:28:41,129 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:41,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:41,295 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:41,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 15:28:41,856 INFO L272 AbstractInterpreter]: Visited 24 different actions 170 times. Merged at 8 different actions 126 times. Widened at 2 different actions 24 times. Found 19 fixpoints after 3 different actions. Largest state had 43 variables. [2018-10-27 15:28:41,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:41,906 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 15:28:41,995 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 85.05% of their original sizes. [2018-10-27 15:28:41,995 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 15:28:42,254 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-10-27 15:28:42,254 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 15:28:42,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 15:28:42,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-10-27 15:28:42,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:42,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 15:28:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 15:28:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-27 15:28:42,257 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 11 states. [2018-10-27 15:28:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:44,846 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2018-10-27 15:28:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 15:28:44,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-10-27 15:28:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:44,852 INFO L225 Difference]: With dead ends: 134 [2018-10-27 15:28:44,853 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 15:28:44,856 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-10-27 15:28:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 15:28:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-27 15:28:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 15:28:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-10-27 15:28:44,881 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2018-10-27 15:28:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:44,882 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-10-27 15:28:44,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 15:28:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2018-10-27 15:28:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 15:28:44,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:44,886 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:44,886 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:44,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1325603312, now seen corresponding path program 1 times [2018-10-27 15:28:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:44,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:44,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:44,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:44,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 15:28:45,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:45,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:45,167 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-10-27 15:28:45,168 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [35], [39], [42], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:28:45,171 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:45,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:45,204 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:45,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:28:45,891 INFO L272 AbstractInterpreter]: Visited 32 different actions 638 times. Merged at 18 different actions 451 times. Widened at 5 different actions 86 times. Found 67 fixpoints after 7 different actions. Largest state had 48 variables. [2018-10-27 15:28:45,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:45,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:28:45,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:45,913 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:28:45,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:45,930 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:28:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:45,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:46,063 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:28:46,076 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:28:46,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-27 15:28:46,210 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 15 treesize of output 11 [2018-10-27 15:28:46,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-27 15:28:46,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,227 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:28:46,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-27 15:28:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:28:46,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:28:46,486 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 15:28:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [4] total 14 [2018-10-27 15:28:46,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:46,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 15:28:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 15:28:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 15:28:46,489 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 8 states. [2018-10-27 15:28:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:47,045 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-10-27 15:28:47,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 15:28:47,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-27 15:28:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:47,047 INFO L225 Difference]: With dead ends: 84 [2018-10-27 15:28:47,047 INFO L226 Difference]: Without dead ends: 56 [2018-10-27 15:28:47,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-27 15:28:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-27 15:28:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-27 15:28:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 15:28:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-10-27 15:28:47,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 36 [2018-10-27 15:28:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:47,057 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-10-27 15:28:47,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 15:28:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-10-27 15:28:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-27 15:28:47,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:47,059 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:47,060 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:47,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:47,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1927482500, now seen corresponding path program 1 times [2018-10-27 15:28:47,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:47,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:47,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:47,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:47,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 15:28:47,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:47,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:47,304 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-27 15:28:47,304 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [60], [64], [68], [72], [74], [77], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:28:47,307 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:47,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:47,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:48,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:28:48,323 INFO L272 AbstractInterpreter]: Visited 33 different actions 907 times. Merged at 23 different actions 667 times. Widened at 8 different actions 143 times. Found 112 fixpoints after 9 different actions. Largest state had 49 variables. [2018-10-27 15:28:48,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:48,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:28:48,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:48,364 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:28:48,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:48,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:28:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:48,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:48,479 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:28:48,487 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:28:48,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:48,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:48,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:48,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-27 15:28:48,811 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 16 treesize of output 12 [2018-10-27 15:28:48,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-10-27 15:28:48,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:48,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:48,829 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:28:48,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-27 15:28:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:28:48,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:28:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 15:28:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 8] total 14 [2018-10-27 15:28:49,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:49,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 15:28:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 15:28:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-27 15:28:49,004 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 7 states. [2018-10-27 15:28:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:49,332 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2018-10-27 15:28:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 15:28:49,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-10-27 15:28:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:49,334 INFO L225 Difference]: With dead ends: 90 [2018-10-27 15:28:49,334 INFO L226 Difference]: Without dead ends: 85 [2018-10-27 15:28:49,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-10-27 15:28:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-27 15:28:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-27 15:28:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 15:28:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-10-27 15:28:49,348 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 38 [2018-10-27 15:28:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:49,349 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-10-27 15:28:49,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 15:28:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-10-27 15:28:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 15:28:49,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:49,351 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:49,351 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:49,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 650168739, now seen corresponding path program 1 times [2018-10-27 15:28:49,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:49,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:49,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:28:49,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:49,595 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:49,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-27 15:28:49,595 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:28:49,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:49,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:49,608 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:50,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:28:50,270 INFO L272 AbstractInterpreter]: Visited 33 different actions 936 times. Merged at 23 different actions 658 times. Widened at 8 different actions 136 times. Found 104 fixpoints after 9 different actions. Largest state had 49 variables. [2018-10-27 15:28:50,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:50,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:28:50,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:50,311 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:28:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:50,326 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:28:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:50,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 15:28:50,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:28:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:50,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2018-10-27 15:28:50,544 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:50,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 15:28:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 15:28:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-27 15:28:50,546 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 8 states. [2018-10-27 15:28:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:51,039 INFO L93 Difference]: Finished difference Result 338 states and 436 transitions. [2018-10-27 15:28:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 15:28:51,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-10-27 15:28:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:51,042 INFO L225 Difference]: With dead ends: 338 [2018-10-27 15:28:51,042 INFO L226 Difference]: Without dead ends: 290 [2018-10-27 15:28:51,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-27 15:28:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-27 15:28:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 88. [2018-10-27 15:28:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-27 15:28:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2018-10-27 15:28:51,085 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 39 [2018-10-27 15:28:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:51,086 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-10-27 15:28:51,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 15:28:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-10-27 15:28:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 15:28:51,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:51,089 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:51,093 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:51,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1841664296, now seen corresponding path program 1 times [2018-10-27 15:28:51,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:51,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:51,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:51,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 15:28:51,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:28:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 15:28:51,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:51,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:28:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:28:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:28:51,232 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 3 states. [2018-10-27 15:28:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:51,321 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2018-10-27 15:28:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:28:51,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-27 15:28:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:51,326 INFO L225 Difference]: With dead ends: 152 [2018-10-27 15:28:51,327 INFO L226 Difference]: Without dead ends: 109 [2018-10-27 15:28:51,327 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:28:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-27 15:28:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-10-27 15:28:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-27 15:28:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-10-27 15:28:51,349 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 47 [2018-10-27 15:28:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:51,350 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-10-27 15:28:51,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:28:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-10-27 15:28:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 15:28:51,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:51,358 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:51,361 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:51,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash 453224470, now seen corresponding path program 2 times [2018-10-27 15:28:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:51,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:51,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:51,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 15:28:51,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:51,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:51,706 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:51,706 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:28:51,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:51,706 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:28:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:28:51,714 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:28:51,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 15:28:51,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:51,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:52,187 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 17 treesize of output 13 [2018-10-27 15:28:52,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:52,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-27 15:28:52,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:52,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:52,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:28:52,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2018-10-27 15:28:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 15:28:52,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:52,710 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:28:52,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:52,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:52,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:1 [2018-10-27 15:28:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 15:28:52,771 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 15:28:52,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [8] total 21 [2018-10-27 15:28:52,771 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:52,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 15:28:52,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 15:28:52,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-27 15:28:52,772 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 9 states. [2018-10-27 15:28:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:53,159 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2018-10-27 15:28:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 15:28:53,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-27 15:28:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:53,161 INFO L225 Difference]: With dead ends: 158 [2018-10-27 15:28:53,161 INFO L226 Difference]: Without dead ends: 129 [2018-10-27 15:28:53,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-10-27 15:28:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-27 15:28:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2018-10-27 15:28:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 15:28:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2018-10-27 15:28:53,181 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 48 [2018-10-27 15:28:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:53,182 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2018-10-27 15:28:53,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 15:28:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2018-10-27 15:28:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 15:28:53,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:53,187 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:53,188 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:53,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash 134038335, now seen corresponding path program 1 times [2018-10-27 15:28:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:53,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:53,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 15:28:53,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:53,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:53,457 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-27 15:28:53,458 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [60], [64], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:28:53,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:53,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:53,468 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:54,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:28:54,556 INFO L272 AbstractInterpreter]: Visited 40 different actions 1582 times. Merged at 30 different actions 1131 times. Widened at 11 different actions 238 times. Found 206 fixpoints after 12 different actions. Largest state had 54 variables. [2018-10-27 15:28:54,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:54,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:28:54,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:54,593 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:28:54,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:54,608 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:28:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:54,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:28:55,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 15:28:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:55,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2018-10-27 15:28:55,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:55,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 15:28:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 15:28:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 15:28:55,265 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand 7 states. [2018-10-27 15:28:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:55,705 INFO L93 Difference]: Finished difference Result 395 states and 511 transitions. [2018-10-27 15:28:55,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 15:28:55,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-10-27 15:28:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:55,707 INFO L225 Difference]: With dead ends: 395 [2018-10-27 15:28:55,707 INFO L226 Difference]: Without dead ends: 315 [2018-10-27 15:28:55,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-27 15:28:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-27 15:28:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 120. [2018-10-27 15:28:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-27 15:28:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-10-27 15:28:55,726 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 51 [2018-10-27 15:28:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:55,727 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-10-27 15:28:55,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 15:28:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-10-27 15:28:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 15:28:55,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:55,728 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:55,728 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:55,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -265971854, now seen corresponding path program 2 times [2018-10-27 15:28:55,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:55,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 15:28:55,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:55,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:55,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:55,976 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:28:55,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:55,976 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:28:55,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:28:55,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:28:56,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 15:28:56,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:56,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 15:28:56,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 15:28:56,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:56,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 22 [2018-10-27 15:28:56,448 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:56,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 15:28:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 15:28:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-10-27 15:28:56,449 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 14 states. [2018-10-27 15:28:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:59,163 INFO L93 Difference]: Finished difference Result 994 states and 1244 transitions. [2018-10-27 15:28:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-27 15:28:59,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-10-27 15:28:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:59,168 INFO L225 Difference]: With dead ends: 994 [2018-10-27 15:28:59,168 INFO L226 Difference]: Without dead ends: 885 [2018-10-27 15:28:59,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=1945, Unknown=0, NotChecked=0, Total=2162 [2018-10-27 15:28:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-10-27 15:28:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 192. [2018-10-27 15:28:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-27 15:28:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2018-10-27 15:28:59,206 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 62 [2018-10-27 15:28:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:59,206 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2018-10-27 15:28:59,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 15:28:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2018-10-27 15:28:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 15:28:59,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:59,208 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:59,208 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:59,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash -34917123, now seen corresponding path program 1 times [2018-10-27 15:28:59,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:59,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:59,210 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 15:28:59,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:59,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:59,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-27 15:28:59,892 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [60], [64], [68], [72], [74], [77], [79], [83], [86], [88], [91], [93], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:28:59,894 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:59,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:59,902 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:29:01,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:29:01,013 INFO L272 AbstractInterpreter]: Visited 41 different actions 1712 times. Merged at 31 different actions 1189 times. Widened at 11 different actions 239 times. Found 287 fixpoints after 15 different actions. Largest state had 54 variables. [2018-10-27 15:29:01,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:01,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:29:01,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:01,051 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:29:01,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:01,064 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:01,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 15:29:01,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 15:29:01,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:01,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2018-10-27 15:29:01,295 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:01,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 15:29:01,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 15:29:01,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-27 15:29:01,296 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand 10 states. [2018-10-27 15:29:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:03,040 INFO L93 Difference]: Finished difference Result 1189 states and 1565 transitions. [2018-10-27 15:29:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 15:29:03,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-10-27 15:29:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:03,045 INFO L225 Difference]: With dead ends: 1189 [2018-10-27 15:29:03,045 INFO L226 Difference]: Without dead ends: 1017 [2018-10-27 15:29:03,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-10-27 15:29:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-10-27 15:29:03,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 238. [2018-10-27 15:29:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-27 15:29:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 290 transitions. [2018-10-27 15:29:03,093 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 290 transitions. Word has length 65 [2018-10-27 15:29:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:03,093 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 290 transitions. [2018-10-27 15:29:03,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 15:29:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 290 transitions. [2018-10-27 15:29:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-27 15:29:03,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:03,095 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:03,095 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:03,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -556623310, now seen corresponding path program 3 times [2018-10-27 15:29:03,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:03,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:03,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:03,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 15:29:03,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:03,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:03,309 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:03,309 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:29:03,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:03,309 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:29:03,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:29:03,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:29:03,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:29:03,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:03,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 15:29:03,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-27 15:29:03,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 16 [2018-10-27 15:29:03,645 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:03,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 15:29:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 15:29:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-10-27 15:29:03,646 INFO L87 Difference]: Start difference. First operand 238 states and 290 transitions. Second operand 12 states. [2018-10-27 15:29:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:05,369 INFO L93 Difference]: Finished difference Result 1635 states and 2138 transitions. [2018-10-27 15:29:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 15:29:05,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-10-27 15:29:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:05,378 INFO L225 Difference]: With dead ends: 1635 [2018-10-27 15:29:05,378 INFO L226 Difference]: Without dead ends: 1420 [2018-10-27 15:29:05,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 15:29:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-10-27 15:29:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 288. [2018-10-27 15:29:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-27 15:29:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2018-10-27 15:29:05,443 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 76 [2018-10-27 15:29:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:05,443 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2018-10-27 15:29:05,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 15:29:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2018-10-27 15:29:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 15:29:05,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:05,445 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:05,445 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:05,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1763983329, now seen corresponding path program 4 times [2018-10-27 15:29:05,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:05,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:05,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:05,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 15:29:05,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:05,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:05,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:05,876 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:29:05,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:05,876 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:29:05,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:05,884 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:05,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 3 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:06,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-27 15:29:06,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:06,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 7] total 19 [2018-10-27 15:29:06,223 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:06,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 15:29:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 15:29:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-10-27 15:29:06,224 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand 14 states. [2018-10-27 15:29:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:09,081 INFO L93 Difference]: Finished difference Result 2149 states and 2794 transitions. [2018-10-27 15:29:09,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-27 15:29:09,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-10-27 15:29:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:09,091 INFO L225 Difference]: With dead ends: 2149 [2018-10-27 15:29:09,091 INFO L226 Difference]: Without dead ends: 1887 [2018-10-27 15:29:09,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=375, Invalid=2487, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 15:29:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2018-10-27 15:29:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 339. [2018-10-27 15:29:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-27 15:29:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 414 transitions. [2018-10-27 15:29:09,187 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 414 transitions. Word has length 87 [2018-10-27 15:29:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:09,187 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 414 transitions. [2018-10-27 15:29:09,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 15:29:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 414 transitions. [2018-10-27 15:29:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-27 15:29:09,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:09,188 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:09,188 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:09,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2091712978, now seen corresponding path program 5 times [2018-10-27 15:29:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:09,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:09,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-27 15:29:09,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:09,606 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:09,606 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:09,606 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:29:09,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:09,607 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:29:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:09,616 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:10,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 15:29:10,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:10,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-27 15:29:10,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-27 15:29:10,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:10,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2018-10-27 15:29:10,875 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:10,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 15:29:10,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 15:29:10,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 15:29:10,876 INFO L87 Difference]: Start difference. First operand 339 states and 414 transitions. Second operand 24 states. [2018-10-27 15:29:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:22,207 INFO L93 Difference]: Finished difference Result 5969 states and 7499 transitions. [2018-10-27 15:29:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-27 15:29:22,207 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-10-27 15:29:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:22,223 INFO L225 Difference]: With dead ends: 5969 [2018-10-27 15:29:22,223 INFO L226 Difference]: Without dead ends: 5649 [2018-10-27 15:29:22,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=729, Invalid=17361, Unknown=0, NotChecked=0, Total=18090 [2018-10-27 15:29:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2018-10-27 15:29:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 517. [2018-10-27 15:29:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-10-27 15:29:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 640 transitions. [2018-10-27 15:29:22,432 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 640 transitions. Word has length 98 [2018-10-27 15:29:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:22,433 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 640 transitions. [2018-10-27 15:29:22,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 15:29:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 640 transitions. [2018-10-27 15:29:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-27 15:29:22,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:22,435 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:22,436 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:22,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash 9829597, now seen corresponding path program 2 times [2018-10-27 15:29:22,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:22,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:22,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-27 15:29:23,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:23,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:23,301 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:23,301 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:29:23,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:23,301 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:29:23,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:23,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:23,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 15:29:23,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:23,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-27 15:29:24,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-27 15:29:24,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:24,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 29 [2018-10-27 15:29:24,505 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:24,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 15:29:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 15:29:24,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-10-27 15:29:24,506 INFO L87 Difference]: Start difference. First operand 517 states and 640 transitions. Second operand 21 states. [2018-10-27 15:29:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:27,619 INFO L93 Difference]: Finished difference Result 4228 states and 5349 transitions. [2018-10-27 15:29:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 15:29:27,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-10-27 15:29:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:27,631 INFO L225 Difference]: With dead ends: 4228 [2018-10-27 15:29:27,631 INFO L226 Difference]: Without dead ends: 3743 [2018-10-27 15:29:27,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 15:29:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2018-10-27 15:29:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 599. [2018-10-27 15:29:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-10-27 15:29:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 742 transitions. [2018-10-27 15:29:27,812 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 742 transitions. Word has length 101 [2018-10-27 15:29:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:27,812 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 742 transitions. [2018-10-27 15:29:27,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 15:29:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 742 transitions. [2018-10-27 15:29:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 15:29:27,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:27,815 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:27,815 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:27,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -604874572, now seen corresponding path program 1 times [2018-10-27 15:29:27,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:27,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:27,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-27 15:29:28,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:28,119 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:28,119 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-10-27 15:29:28,119 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [58], [60], [64], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-27 15:29:28,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:29:28,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:29:28,126 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:29:29,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:29:29,241 INFO L272 AbstractInterpreter]: Visited 41 different actions 1740 times. Merged at 31 different actions 1218 times. Widened at 11 different actions 248 times. Found 277 fixpoints after 14 different actions. Largest state had 54 variables. [2018-10-27 15:29:29,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:29,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:29:29,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:29,279 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:29:29,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:29,291 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:29,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 158 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-27 15:29:29,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-27 15:29:29,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 8] total 24 [2018-10-27 15:29:29,883 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:29,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 15:29:29,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 15:29:29,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-10-27 15:29:29,884 INFO L87 Difference]: Start difference. First operand 599 states and 742 transitions. Second operand 18 states. [2018-10-27 15:29:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:36,791 INFO L93 Difference]: Finished difference Result 5564 states and 7238 transitions. [2018-10-27 15:29:36,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-27 15:29:36,791 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2018-10-27 15:29:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:36,805 INFO L225 Difference]: With dead ends: 5564 [2018-10-27 15:29:36,805 INFO L226 Difference]: Without dead ends: 5000 [2018-10-27 15:29:36,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=670, Invalid=6302, Unknown=0, NotChecked=0, Total=6972 [2018-10-27 15:29:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2018-10-27 15:29:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 602. [2018-10-27 15:29:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-27 15:29:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 744 transitions. [2018-10-27 15:29:37,071 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 744 transitions. Word has length 104 [2018-10-27 15:29:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:37,072 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 744 transitions. [2018-10-27 15:29:37,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 15:29:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 744 transitions. [2018-10-27 15:29:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 15:29:37,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:37,075 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 7, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:37,075 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:37,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash -143387361, now seen corresponding path program 6 times [2018-10-27 15:29:37,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:37,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:37,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-10-27 15:29:37,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:37,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:37,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:37,333 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:29:37,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:37,333 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:29:37,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:29:37,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:29:37,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:29:37,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:37,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 209 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-27 15:29:37,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-10-27 15:29:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 23 [2018-10-27 15:29:37,736 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:37,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 15:29:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 15:29:37,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-10-27 15:29:37,737 INFO L87 Difference]: Start difference. First operand 602 states and 744 transitions. Second operand 16 states. [2018-10-27 15:29:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:42,589 INFO L93 Difference]: Finished difference Result 4556 states and 5903 transitions. [2018-10-27 15:29:42,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-27 15:29:42,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-10-27 15:29:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:42,603 INFO L225 Difference]: With dead ends: 4556 [2018-10-27 15:29:42,603 INFO L226 Difference]: Without dead ends: 4113 [2018-10-27 15:29:42,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=583, Invalid=4529, Unknown=0, NotChecked=0, Total=5112 [2018-10-27 15:29:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-10-27 15:29:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 685. [2018-10-27 15:29:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-10-27 15:29:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 847 transitions. [2018-10-27 15:29:42,831 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 847 transitions. Word has length 115 [2018-10-27 15:29:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:42,832 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 847 transitions. [2018-10-27 15:29:42,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 15:29:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 847 transitions. [2018-10-27 15:29:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-27 15:29:42,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:42,834 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 8, 8, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:42,835 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:42,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1974424065, now seen corresponding path program 7 times [2018-10-27 15:29:42,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:42,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:42,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:42,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:42,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-10-27 15:29:44,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:44,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:44,022 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:44,023 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:29:44,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:44,023 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:29:44,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:44,035 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:44,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 3 proven. 244 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-27 15:29:44,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 3 proven. 98 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-27 15:29:44,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:44,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 10] total 26 [2018-10-27 15:29:44,589 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:44,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 15:29:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 15:29:44,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-10-27 15:29:44,590 INFO L87 Difference]: Start difference. First operand 685 states and 847 transitions. Second operand 18 states. [2018-10-27 15:29:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:51,217 INFO L93 Difference]: Finished difference Result 5646 states and 7293 transitions. [2018-10-27 15:29:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-27 15:29:51,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-10-27 15:29:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:51,236 INFO L225 Difference]: With dead ends: 5646 [2018-10-27 15:29:51,237 INFO L226 Difference]: Without dead ends: 5147 [2018-10-27 15:29:51,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=746, Invalid=7264, Unknown=0, NotChecked=0, Total=8010 [2018-10-27 15:29:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2018-10-27 15:29:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 769. [2018-10-27 15:29:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-10-27 15:29:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 952 transitions. [2018-10-27 15:29:51,516 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 952 transitions. Word has length 123 [2018-10-27 15:29:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:51,516 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 952 transitions. [2018-10-27 15:29:51,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 15:29:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 952 transitions. [2018-10-27 15:29:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 15:29:51,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:51,519 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:51,519 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:51,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1691602911, now seen corresponding path program 8 times [2018-10-27 15:29:51,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:51,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:51,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 128 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-27 15:29:52,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:52,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:52,210 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:52,210 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:29:52,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:52,210 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:29:52,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:52,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:52,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-27 15:29:52,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:52,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-27 15:29:53,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-27 15:29:54,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:54,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22] total 51 [2018-10-27 15:29:54,441 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:54,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 15:29:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 15:29:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2413, Unknown=0, NotChecked=0, Total=2550 [2018-10-27 15:29:54,443 INFO L87 Difference]: Start difference. First operand 769 states and 952 transitions. Second operand 31 states. [2018-10-27 15:30:08,249 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 15:30:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:10,988 INFO L93 Difference]: Finished difference Result 2545 states and 3218 transitions. [2018-10-27 15:30:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-27 15:30:10,988 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 131 [2018-10-27 15:30:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:10,993 INFO L225 Difference]: With dead ends: 2545 [2018-10-27 15:30:10,993 INFO L226 Difference]: Without dead ends: 1959 [2018-10-27 15:30:11,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14167 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1196, Invalid=44386, Unknown=0, NotChecked=0, Total=45582 [2018-10-27 15:30:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2018-10-27 15:30:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1035. [2018-10-27 15:30:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-10-27 15:30:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1271 transitions. [2018-10-27 15:30:11,494 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1271 transitions. Word has length 131 [2018-10-27 15:30:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:11,495 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1271 transitions. [2018-10-27 15:30:11,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 15:30:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1271 transitions. [2018-10-27 15:30:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 15:30:11,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:11,498 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:11,498 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:11,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -800145240, now seen corresponding path program 9 times [2018-10-27 15:30:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:11,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:30:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:11,499 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-27 15:30:11,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:11,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:11,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:11,830 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:30:11,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:11,830 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:30:11,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:30:11,844 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:30:11,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:30:11,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:30:11,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 3 proven. 317 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-27 15:30:12,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-27 15:30:12,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:12,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 12] total 32 [2018-10-27 15:30:12,465 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:12,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 15:30:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 15:30:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-10-27 15:30:12,466 INFO L87 Difference]: Start difference. First operand 1035 states and 1271 transitions. Second operand 22 states. [2018-10-27 15:30:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:26,233 INFO L93 Difference]: Finished difference Result 9829 states and 12421 transitions. [2018-10-27 15:30:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-27 15:30:26,233 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2018-10-27 15:30:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:26,248 INFO L225 Difference]: With dead ends: 9829 [2018-10-27 15:30:26,248 INFO L226 Difference]: Without dead ends: 9404 [2018-10-27 15:30:26,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1066, Invalid=16226, Unknown=0, NotChecked=0, Total=17292 [2018-10-27 15:30:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9404 states. [2018-10-27 15:30:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9404 to 1075. [2018-10-27 15:30:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-10-27 15:30:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1321 transitions. [2018-10-27 15:30:26,825 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1321 transitions. Word has length 135 [2018-10-27 15:30:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:26,825 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1321 transitions. [2018-10-27 15:30:26,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 15:30:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1321 transitions. [2018-10-27 15:30:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 15:30:26,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:26,828 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:26,828 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:26,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 803349745, now seen corresponding path program 10 times [2018-10-27 15:30:26,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:26,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:30:26,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:26,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 32 proven. 130 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-10-27 15:30:30,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:30,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:30,263 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:30,263 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:30:30,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:30,264 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:30:30,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:30,271 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:30:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:30,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:30,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:30:30,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:30,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 56 [2018-10-27 15:30:30,682 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 56 treesize of output 59 [2018-10-27 15:30:30,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 73 [2018-10-27 15:30:30,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,700 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 103 [2018-10-27 15:30:30,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 149 [2018-10-27 15:30:30,716 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,721 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,723 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 211 [2018-10-27 15:30:30,754 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 289 [2018-10-27 15:30:30,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,931 INFO L303 Elim1Store]: Index analysis took 159 ms [2018-10-27 15:30:30,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 383 [2018-10-27 15:30:30,945 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 493 [2018-10-27 15:30:30,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:30,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 72 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 619 [2018-10-27 15:30:31,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,071 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 90 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 761 [2018-10-27 15:30:31,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,140 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,149 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,154 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:31,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 110 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 1026 [2018-10-27 15:30:31,161 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:31,874 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,000 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,100 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,178 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,337 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:32,496 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:79, output treesize:111 [2018-10-27 15:30:32,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:32,593 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:30:32,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:32,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:32,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:32,894 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:30:32,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:32,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:32,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:111 [2018-10-27 15:30:33,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:33,078 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:30:33,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:33,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:33,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:33,260 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:30:33,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:33,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:33,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:33,558 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:30:33,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:33,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:33,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:33,843 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:30:33,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:33,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:34,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:34,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:34,256 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:30:34,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:34,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:34,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:34,479 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:30:34,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:34,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-27 15:30:34,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:34,699 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:30:34,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:34,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2018-10-27 15:30:34,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-27 15:30:34,884 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:30:34,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:34,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:34,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2018-10-27 15:30:34,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-10-27 15:30:34,988 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 10 treesize of output 9 [2018-10-27 15:30:34,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:35,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:35,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:35,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:124, output treesize:111 [2018-10-27 15:30:36,876 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-10-27 15:30:40,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 99 [2018-10-27 15:30:40,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-10-27 15:30:40,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:40,939 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,942 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,945 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,946 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,948 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,962 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,964 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,972 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,976 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,978 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:40,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,011 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,014 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,015 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,020 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,027 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,030 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,031 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,042 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,045 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,046 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,047 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,048 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,059 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,061 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:41,075 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-10-27 15:30:41,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 110 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 483 [2018-10-27 15:30:41,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:41,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:41,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:41,301 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:134, output treesize:7 [2018-10-27 15:30:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 64 proven. 421 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:30:41,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:32:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 73 proven. 382 refuted. 33 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 15:32:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:32:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 37, 52] total 105 [2018-10-27 15:32:47,363 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:32:47,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-27 15:32:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-27 15:32:47,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1813, Invalid=9053, Unknown=54, NotChecked=0, Total=10920 [2018-10-27 15:32:47,365 INFO L87 Difference]: Start difference. First operand 1075 states and 1321 transitions. Second operand 55 states. [2018-10-27 15:32:50,867 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 Received shutdown request... [2018-10-27 15:32:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 15:32:51,017 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 15:32:51,022 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 15:32:51,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 03:32:51 BoogieIcfgContainer [2018-10-27 15:32:51,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 15:32:51,024 INFO L168 Benchmark]: Toolchain (without parser) took 252369.09 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -703.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-27 15:32:51,024 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:32:51,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 15:32:51,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:32:51,025 INFO L168 Benchmark]: Boogie Preprocessor took 61.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:32:51,026 INFO L168 Benchmark]: RCFGBuilder took 839.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-10-27 15:32:51,026 INFO L168 Benchmark]: TraceAbstraction took 251036.86 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 73.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-27 15:32:51,033 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 839.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251036.86 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 73.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (1075states) and FLOYD_HOARE automaton (currently 17 states, 55 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 120 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. TIMEOUT Result, 250.9s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 81.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5277 SDtfs, 10211 SDslu, 75168 SDs, 0 SdLazy, 59859 SolverSat, 1971 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4191 GetRequests, 3033 SyntacticMatches, 30 SemanticMatches, 1127 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35882 ImplicationChecksByTransitivity, 164.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1075occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.7s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.7368091238116813 AbsIntWeakeningRatio, 1.96 AbsIntAvgWeakeningVarsNumRemoved, 11.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 34420 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 154.9s InterpolantComputationTime, 3009 NumberOfCodeBlocks, 2984 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 4402 ConstructedInterpolants, 154 QuantifiedInterpolants, 4547872 SizeOfPredicates, 173 NumberOfNonLiveVariables, 6805 ConjunctsInSsa, 673 ConjunctsInUnsatCore, 55 InterpolantComputations, 8 PerfectInterpolantSequences, 4784/9118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown