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-EXP.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:24:15,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:24:15,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:24:15,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:24:15,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:24:15,777 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:24:15,778 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:24:15,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:24:15,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:24:15,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:24:15,785 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:24:15,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:24:15,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:24:15,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:24:15,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:24:15,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:24:15,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:24:15,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:24:15,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:24:15,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:24:15,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:24:15,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:24:15,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:24:15,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:24:15,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:24:15,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:24:15,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:24:15,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:24:15,806 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:24:15,807 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:24:15,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:24:15,808 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:24:15,809 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:24:15,809 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:24:15,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:24:15,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:24:15,811 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:24:15,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:24:15,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:24:15,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:24:15,833 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:24:15,833 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:24:15,833 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:24:15,833 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:24:15,833 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:24:15,834 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:24:15,834 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:24:15,834 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:24:15,834 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:24:15,834 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:24:15,835 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:24:15,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:24:15,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:24:15,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:24:15,836 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:24:15,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:24:15,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:24:15,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:24:15,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:24:15,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:24:15,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:24:15,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:24:15,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:24:15,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:24:15,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:24:15,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:24:15,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:24:15,841 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:24:15,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:24:15,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:24:15,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:24:15,842 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:24:15,842 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:24:15,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:24:15,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:24:15,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:24:15,923 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:24:15,924 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:24:15,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-10-24 12:24:15,992 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3ec3b9467/baa5741c9a8747b5bc065a5286bf967e/FLAGc44b1d945 [2018-10-24 12:24:16,465 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:24:16,466 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-10-24 12:24:16,477 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3ec3b9467/baa5741c9a8747b5bc065a5286bf967e/FLAGc44b1d945 [2018-10-24 12:24:16,500 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3ec3b9467/baa5741c9a8747b5bc065a5286bf967e [2018-10-24 12:24:16,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:24:16,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:24:16,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:24:16,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:24:16,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:24:16,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:16,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16, skipping insertion in model container [2018-10-24 12:24:16,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:16,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:24:16,573 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:24:16,837 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:24:16,844 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:24:16,918 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:24:16,953 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:24:16,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16 WrapperNode [2018-10-24 12:24:16,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:24:16,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:24:16,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:24:16,956 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:24:16,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:16,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:24:17,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:24:17,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:24:17,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:24:17,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (1/1) ... [2018-10-24 12:24:17,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:24:17,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:24:17,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:24:17,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:24:17,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (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-24 12:24:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:24:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:24:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:24:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:24:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:24:17,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:24:17,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:24:17,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:24:18,469 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:24:18,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:24:18 BoogieIcfgContainer [2018-10-24 12:24:18,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:24:18,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:24:18,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:24:18,475 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:24:18,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:24:16" (1/3) ... [2018-10-24 12:24:18,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2f7446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:24:18, skipping insertion in model container [2018-10-24 12:24:18,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:16" (2/3) ... [2018-10-24 12:24:18,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2f7446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:24:18, skipping insertion in model container [2018-10-24 12:24:18,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:24:18" (3/3) ... [2018-10-24 12:24:18,479 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-10-24 12:24:18,489 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:24:18,498 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:24:18,516 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:24:18,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:24:18,551 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:24:18,551 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:24:18,551 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:24:18,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:24:18,554 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:24:18,554 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:24:18,554 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:24:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-10-24 12:24:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:24:18,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:18,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:18,584 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:18,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:18,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1090382313, now seen corresponding path program 1 times [2018-10-24 12:24:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:18,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:18,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:18,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:18,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:18,810 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-24 12:24:18,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:18,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:24:18,813 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:18,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:24:18,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:24:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:24:18,839 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-10-24 12:24:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:18,866 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2018-10-24 12:24:18,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:24:18,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-10-24 12:24:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:18,877 INFO L225 Difference]: With dead ends: 70 [2018-10-24 12:24:18,878 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:24:18,882 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-24 12:24:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:24:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-24 12:24:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 12:24:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-10-24 12:24:18,924 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2018-10-24 12:24:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:18,924 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-10-24 12:24:18,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:24:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-10-24 12:24:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:24:18,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:18,926 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] [2018-10-24 12:24:18,926 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:18,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -448793496, now seen corresponding path program 1 times [2018-10-24 12:24:18,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:18,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:19,180 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-24 12:24:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:19,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:24:19,180 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:19,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:24:19,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:24:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:24:19,183 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-10-24 12:24:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:19,444 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-10-24 12:24:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:24:19,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 12:24:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:19,447 INFO L225 Difference]: With dead ends: 64 [2018-10-24 12:24:19,447 INFO L226 Difference]: Without dead ends: 39 [2018-10-24 12:24:19,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:24:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-24 12:24:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-24 12:24:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:24:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-24 12:24:19,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2018-10-24 12:24:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:19,457 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-24 12:24:19,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:24:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-10-24 12:24:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 12:24:19,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:19,458 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] [2018-10-24 12:24:19,459 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:19,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1500559425, now seen corresponding path program 1 times [2018-10-24 12:24:19,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:19,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:19,597 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-24 12:24:19,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:19,598 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:19,599 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-24 12:24:19,601 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [21], [25], [29], [32], [58], [62], [65], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:24:19,642 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:19,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:19,904 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:24:19,910 INFO L272 AbstractInterpreter]: Visited 11 different actions 15 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-10-24 12:24:19,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:19,948 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:24:20,150 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 88.62% of their original sizes. [2018-10-24 12:24:20,151 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:24:20,324 INFO L413 sIntCurrentIteration]: We have 24 unified AI predicates [2018-10-24 12:24:20,325 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:24:20,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:20,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-24 12:24:20,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:20,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:24:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:24:20,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:24:20,330 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2018-10-24 12:24:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:21,579 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-10-24 12:24:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:24:21,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-24 12:24:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:21,581 INFO L225 Difference]: With dead ends: 72 [2018-10-24 12:24:21,581 INFO L226 Difference]: Without dead ends: 43 [2018-10-24 12:24:21,584 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-24 12:24:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-24 12:24:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-24 12:24:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-10-24 12:24:21,595 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2018-10-24 12:24:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:21,596 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-10-24 12:24:21,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:24:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-10-24 12:24:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 12:24:21,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:21,599 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:21,599 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:21,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1612370840, now seen corresponding path program 1 times [2018-10-24 12:24:21,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:21,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:21,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:21,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:21,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-24 12:24:21,888 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [58], [62], [65], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:24:21,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:21,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:22,101 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:24:22,102 INFO L272 AbstractInterpreter]: Visited 15 different actions 51 times. Merged at 8 different actions 26 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 48 variables. [2018-10-24 12:24:22,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:22,141 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:24:22,234 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 78.59% of their original sizes. [2018-10-24 12:24:22,234 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:24:22,438 INFO L413 sIntCurrentIteration]: We have 28 unified AI predicates [2018-10-24 12:24:22,438 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:24:22,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-24 12:24:22,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:22,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:24:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:24:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:22,440 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 6 states. [2018-10-24 12:24:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:23,128 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-10-24 12:24:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:23,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-10-24 12:24:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:23,131 INFO L225 Difference]: With dead ends: 76 [2018-10-24 12:24:23,132 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 12:24:23,133 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 12:24:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2018-10-24 12:24:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-24 12:24:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-10-24 12:24:23,146 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2018-10-24 12:24:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:23,146 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-10-24 12:24:23,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:24:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-10-24 12:24:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 12:24:23,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:23,148 INFO L375 BasicCegarLoop]: trace histogram [3, 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-24 12:24:23,148 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:23,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash -554026779, now seen corresponding path program 1 times [2018-10-24 12:24:23,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:23,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:23,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:23,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:23,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:23,293 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-24 12:24:23,293 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:24:23,297 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:23,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:23,433 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:24:23,434 INFO L272 AbstractInterpreter]: Visited 18 different actions 57 times. Merged at 10 different actions 28 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 55 variables. [2018-10-24 12:24:23,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:23,474 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:24:23,550 INFO L232 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 62.12% of their original sizes. [2018-10-24 12:24:23,551 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:24:23,841 INFO L413 sIntCurrentIteration]: We have 37 unified AI predicates [2018-10-24 12:24:23,841 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:24:23,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:23,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-24 12:24:23,842 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:23,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:23,843 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-10-24 12:24:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:24,670 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-10-24 12:24:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:24,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-10-24 12:24:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:24,672 INFO L225 Difference]: With dead ends: 89 [2018-10-24 12:24:24,672 INFO L226 Difference]: Without dead ends: 63 [2018-10-24 12:24:24,673 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:24:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-24 12:24:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2018-10-24 12:24:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:24:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-10-24 12:24:24,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 38 [2018-10-24 12:24:24,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:24,683 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-10-24 12:24:24,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-10-24 12:24:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-24 12:24:24,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:24,684 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-24 12:24:24,685 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:24,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash -556797698, now seen corresponding path program 1 times [2018-10-24 12:24:24,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:24,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:24,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:24,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:24,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:24:25,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:25,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:25,035 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-24 12:24:25,035 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [43], [48], [50], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:24:25,039 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:25,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:25,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:25,355 INFO L272 AbstractInterpreter]: Visited 35 different actions 134 times. Merged at 22 different actions 75 times. Widened at 3 different actions 5 times. Found 19 fixpoints after 11 different actions. Largest state had 61 variables. [2018-10-24 12:24:25,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:25,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:25,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:25,397 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-24 12:24:25,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:25,414 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:25,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:24:25,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:24:26,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:26,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-24 12:24:26,007 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:26,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:24:26,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:24:26,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:26,009 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 8 states. [2018-10-24 12:24:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:26,437 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2018-10-24 12:24:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:26,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-10-24 12:24:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:26,439 INFO L225 Difference]: With dead ends: 93 [2018-10-24 12:24:26,439 INFO L226 Difference]: Without dead ends: 62 [2018-10-24 12:24:26,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-24 12:24:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2018-10-24 12:24:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:24:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-10-24 12:24:26,449 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 42 [2018-10-24 12:24:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:26,450 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-10-24 12:24:26,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:24:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-10-24 12:24:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 12:24:26,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:26,451 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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-24 12:24:26,452 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:26,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1742006791, now seen corresponding path program 2 times [2018-10-24 12:24:26,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:24:26,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:26,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:26,868 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:26,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:26,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:26,868 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-24 12:24:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:26,888 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:27,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:24:27,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:27,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-24 12:24:27,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-24 12:24:27,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:27,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2018-10-24 12:24:27,403 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:27,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:24:27,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:24:27,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:27,404 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 10 states. [2018-10-24 12:24:27,610 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-24 12:24:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:27,954 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2018-10-24 12:24:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:27,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-10-24 12:24:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:27,957 INFO L225 Difference]: With dead ends: 140 [2018-10-24 12:24:27,957 INFO L226 Difference]: Without dead ends: 109 [2018-10-24 12:24:27,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:24:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-24 12:24:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2018-10-24 12:24:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-24 12:24:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-10-24 12:24:27,970 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2018-10-24 12:24:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:27,970 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-10-24 12:24:27,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:24:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-10-24 12:24:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:24:27,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:27,972 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 12:24:27,972 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:27,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash -544875330, now seen corresponding path program 3 times [2018-10-24 12:24:27,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:27,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 12:24:28,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:28,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:28,379 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:28,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:28,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:28,380 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-24 12:24:28,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:28,396 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:28,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:28,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:28,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:24:28,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:24:28,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:28,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-24 12:24:28,765 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:28,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:24:28,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:24:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:28,766 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 9 states. [2018-10-24 12:24:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:29,387 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2018-10-24 12:24:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:24:29,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-10-24 12:24:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:29,389 INFO L225 Difference]: With dead ends: 154 [2018-10-24 12:24:29,389 INFO L226 Difference]: Without dead ends: 105 [2018-10-24 12:24:29,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-24 12:24:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-10-24 12:24:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-24 12:24:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2018-10-24 12:24:29,404 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 60 [2018-10-24 12:24:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:29,405 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2018-10-24 12:24:29,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:24:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-10-24 12:24:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 12:24:29,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:29,406 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 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] [2018-10-24 12:24:29,407 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:29,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1448575321, now seen corresponding path program 4 times [2018-10-24 12:24:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:29,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:29,408 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:29,927 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-24 12:24:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 12:24:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:29,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:29,954 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:29,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:29,955 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-24 12:24:29,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:29,963 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:30,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 12:24:30,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 12:24:30,475 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-10-24 12:24:30,476 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:30,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:24:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:24:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:24:30,477 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 4 states. [2018-10-24 12:24:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:30,631 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2018-10-24 12:24:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:24:30,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-10-24 12:24:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:30,633 INFO L225 Difference]: With dead ends: 146 [2018-10-24 12:24:30,633 INFO L226 Difference]: Without dead ends: 82 [2018-10-24 12:24:30,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:24:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-24 12:24:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-10-24 12:24:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-24 12:24:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-10-24 12:24:30,647 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 72 [2018-10-24 12:24:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:30,647 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-10-24 12:24:30,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:24:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-10-24 12:24:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 12:24:30,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:30,649 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:30,649 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:30,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1246751387, now seen corresponding path program 5 times [2018-10-24 12:24:30,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:30,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:30,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:30,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:30,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 12:24:30,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:30,844 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:30,844 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:30,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:30,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:30,845 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-24 12:24:30,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:30,852 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:31,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:31,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:31,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 12:24:31,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 12:24:31,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:31,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2018-10-24 12:24:31,272 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:31,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:24:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:24:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:31,273 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 10 states. [2018-10-24 12:24:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:31,734 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2018-10-24 12:24:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:24:31,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-10-24 12:24:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:31,736 INFO L225 Difference]: With dead ends: 152 [2018-10-24 12:24:31,736 INFO L226 Difference]: Without dead ends: 99 [2018-10-24 12:24:31,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:24:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-24 12:24:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2018-10-24 12:24:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-24 12:24:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-10-24 12:24:31,755 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 72 [2018-10-24 12:24:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:31,755 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-10-24 12:24:31,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:24:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-10-24 12:24:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 12:24:31,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:31,761 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:31,761 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 803986661, now seen corresponding path program 6 times [2018-10-24 12:24:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:31,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:31,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:31,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 12:24:31,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:31,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:31,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:31,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:31,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:31,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 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-24 12:24:31,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:31,921 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:31,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:31,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:31,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 12:24:32,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 12:24:32,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-10-24 12:24:32,600 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:32,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:24:32,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:24:32,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:32,601 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 9 states. [2018-10-24 12:24:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:32,964 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-10-24 12:24:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:32,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-10-24 12:24:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:32,965 INFO L225 Difference]: With dead ends: 163 [2018-10-24 12:24:32,966 INFO L226 Difference]: Without dead ends: 111 [2018-10-24 12:24:32,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-24 12:24:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-10-24 12:24:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-24 12:24:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-10-24 12:24:32,979 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 88 [2018-10-24 12:24:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:32,980 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-10-24 12:24:32,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:24:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-10-24 12:24:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 12:24:32,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:32,982 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:32,982 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:32,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1282364450, now seen corresponding path program 7 times [2018-10-24 12:24:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:32,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:32,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 106 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-24 12:24:33,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:33,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:33,197 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:33,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:33,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:33,197 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-24 12:24:33,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:33,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:33,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 106 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-24 12:24:33,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 106 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-24 12:24:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-24 12:24:33,504 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:33,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:24:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:24:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:33,505 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 11 states. [2018-10-24 12:24:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:33,949 INFO L93 Difference]: Finished difference Result 183 states and 217 transitions. [2018-10-24 12:24:33,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:33,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-10-24 12:24:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:33,950 INFO L225 Difference]: With dead ends: 183 [2018-10-24 12:24:33,950 INFO L226 Difference]: Without dead ends: 123 [2018-10-24 12:24:33,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-24 12:24:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-10-24 12:24:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-24 12:24:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-10-24 12:24:33,965 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 100 [2018-10-24 12:24:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:33,965 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-10-24 12:24:33,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:24:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-10-24 12:24:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-24 12:24:33,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:33,968 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:33,968 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:33,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash -639890089, now seen corresponding path program 8 times [2018-10-24 12:24:33,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:33,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:33,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:33,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:33,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 170 proven. 32 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-10-24 12:24:34,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:34,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:34,155 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:34,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:34,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:34,155 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-24 12:24:34,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:34,163 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:34,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:34,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:34,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-10-24 12:24:34,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-10-24 12:24:34,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:34,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2018-10-24 12:24:34,912 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:34,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:24:34,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:24:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:24:34,913 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 11 states. [2018-10-24 12:24:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:35,762 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2018-10-24 12:24:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 12:24:35,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-10-24 12:24:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:35,765 INFO L225 Difference]: With dead ends: 249 [2018-10-24 12:24:35,766 INFO L226 Difference]: Without dead ends: 181 [2018-10-24 12:24:35,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=728, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:24:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-24 12:24:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 133. [2018-10-24 12:24:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-24 12:24:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2018-10-24 12:24:35,782 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 112 [2018-10-24 12:24:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:35,783 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-10-24 12:24:35,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:24:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2018-10-24 12:24:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-24 12:24:35,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:35,784 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:35,785 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:35,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1673782583, now seen corresponding path program 9 times [2018-10-24 12:24:35,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:35,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:35,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 250 proven. 50 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-10-24 12:24:36,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:36,744 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:36,745 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:36,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:36,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:36,745 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-24 12:24:36,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:36,761 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:36,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:36,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:36,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 38 proven. 236 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-24 12:24:37,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 38 proven. 236 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-24 12:24:37,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:37,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 25 [2018-10-24 12:24:37,223 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:37,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:24:37,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:24:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:24:37,225 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 19 states. [2018-10-24 12:24:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:39,458 INFO L93 Difference]: Finished difference Result 318 states and 386 transitions. [2018-10-24 12:24:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-24 12:24:39,459 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2018-10-24 12:24:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:39,460 INFO L225 Difference]: With dead ends: 318 [2018-10-24 12:24:39,460 INFO L226 Difference]: Without dead ends: 238 [2018-10-24 12:24:39,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 241 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=960, Invalid=2946, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 12:24:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-24 12:24:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 149. [2018-10-24 12:24:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-24 12:24:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2018-10-24 12:24:39,481 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 128 [2018-10-24 12:24:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:39,481 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2018-10-24 12:24:39,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:24:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-10-24 12:24:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 12:24:39,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:39,483 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:39,483 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:39,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2123608773, now seen corresponding path program 10 times [2018-10-24 12:24:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:39,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:39,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:39,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-24 12:24:39,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:39,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:39,719 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:39,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:39,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:39,719 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-24 12:24:39,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:39,728 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:39,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-24 12:24:39,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-24 12:24:40,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:40,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-10-24 12:24:40,104 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:40,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 12:24:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 12:24:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:24:40,106 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 17 states. [2018-10-24 12:24:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:40,667 INFO L93 Difference]: Finished difference Result 259 states and 308 transitions. [2018-10-24 12:24:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:24:40,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 144 [2018-10-24 12:24:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:40,669 INFO L225 Difference]: With dead ends: 259 [2018-10-24 12:24:40,669 INFO L226 Difference]: Without dead ends: 167 [2018-10-24 12:24:40,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:24:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-24 12:24:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2018-10-24 12:24:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-24 12:24:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-10-24 12:24:40,687 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 144 [2018-10-24 12:24:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:40,687 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-10-24 12:24:40,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 12:24:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-10-24 12:24:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-24 12:24:40,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:40,689 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:40,689 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:40,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1855267532, now seen corresponding path program 11 times [2018-10-24 12:24:40,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:40,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:40,691 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 458 proven. 98 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-10-24 12:24:41,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:41,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:41,150 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:41,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:41,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:41,151 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-24 12:24:41,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:41,160 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:41,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-24 12:24:41,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:41,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2018-10-24 12:24:41,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2018-10-24 12:24:41,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:41,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2018-10-24 12:24:41,950 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:41,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:24:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:24:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:24:41,951 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 16 states. [2018-10-24 12:24:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:44,200 INFO L93 Difference]: Finished difference Result 429 states and 524 transitions. [2018-10-24 12:24:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-24 12:24:44,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2018-10-24 12:24:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:44,203 INFO L225 Difference]: With dead ends: 429 [2018-10-24 12:24:44,203 INFO L226 Difference]: Without dead ends: 329 [2018-10-24 12:24:44,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1546, Invalid=3146, Unknown=0, NotChecked=0, Total=4692 [2018-10-24 12:24:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-24 12:24:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 177. [2018-10-24 12:24:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-24 12:24:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 207 transitions. [2018-10-24 12:24:44,226 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 207 transitions. Word has length 156 [2018-10-24 12:24:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:44,227 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 207 transitions. [2018-10-24 12:24:44,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:24:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2018-10-24 12:24:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 12:24:44,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:44,229 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 24, 24, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:44,229 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:44,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1216945498, now seen corresponding path program 12 times [2018-10-24 12:24:44,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:44,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:44,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 586 proven. 128 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2018-10-24 12:24:44,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:44,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:44,498 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:44,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:44,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:44,498 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-24 12:24:44,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:44,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:44,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:44,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:44,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 104 proven. 592 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2018-10-24 12:24:45,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 104 proven. 592 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2018-10-24 12:24:45,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:45,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 36 [2018-10-24 12:24:45,265 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:45,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:24:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:24:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:24:45,267 INFO L87 Difference]: Start difference. First operand 177 states and 207 transitions. Second operand 27 states. [2018-10-24 12:24:47,654 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-10-24 12:24:49,069 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-10-24 12:24:50,066 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-24 12:24:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:50,457 INFO L93 Difference]: Finished difference Result 523 states and 641 transitions. [2018-10-24 12:24:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-24 12:24:50,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 172 [2018-10-24 12:24:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:50,461 INFO L225 Difference]: With dead ends: 523 [2018-10-24 12:24:50,461 INFO L226 Difference]: Without dead ends: 411 [2018-10-24 12:24:50,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 321 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2553, Invalid=9657, Unknown=0, NotChecked=0, Total=12210 [2018-10-24 12:24:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-24 12:24:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 193. [2018-10-24 12:24:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-24 12:24:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-10-24 12:24:50,488 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 172 [2018-10-24 12:24:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:50,488 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-10-24 12:24:50,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:24:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-10-24 12:24:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 12:24:50,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:50,490 INFO L375 BasicCegarLoop]: trace histogram [30, 27, 27, 27, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:50,490 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:50,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1852116248, now seen corresponding path program 13 times [2018-10-24 12:24:50,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:50,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:50,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 730 proven. 162 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-24 12:24:50,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:50,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:50,892 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:50,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:50,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:50,893 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-24 12:24:50,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:50,900 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:51,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 730 proven. 162 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-24 12:24:51,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 730 proven. 162 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-24 12:24:51,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:51,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2018-10-24 12:24:51,450 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:51,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:24:51,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:24:51,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:24:51,452 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 23 states. [2018-10-24 12:24:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:53,063 INFO L93 Difference]: Finished difference Result 335 states and 399 transitions. [2018-10-24 12:24:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:24:53,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 188 [2018-10-24 12:24:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:53,065 INFO L225 Difference]: With dead ends: 335 [2018-10-24 12:24:53,065 INFO L226 Difference]: Without dead ends: 211 [2018-10-24 12:24:53,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:24:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-24 12:24:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2018-10-24 12:24:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-24 12:24:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 241 transitions. [2018-10-24 12:24:53,092 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 241 transitions. Word has length 188 [2018-10-24 12:24:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:53,093 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 241 transitions. [2018-10-24 12:24:53,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:24:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 241 transitions. [2018-10-24 12:24:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-24 12:24:53,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:53,095 INFO L375 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:53,095 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:53,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1297877905, now seen corresponding path program 14 times [2018-10-24 12:24:53,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:53,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:53,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:53,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:53,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 890 proven. 200 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-24 12:24:54,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:54,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:54,424 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:54,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:54,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:54,425 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-24 12:24:54,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:54,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:54,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:24:54,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:55,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:55,077 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 15 treesize of output 12 [2018-10-24 12:24:55,080 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 12 treesize of output 11 [2018-10-24 12:24:55,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,100 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-24 12:24:55,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-24 12:24:55,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-24 12:24:55,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:55,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:24:55,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,245 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-24 12:24:55,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-10-24 12:24:55,302 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 19 treesize of output 14 [2018-10-24 12:24:55,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 22 [2018-10-24 12:24:55,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:55,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:24:55,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:24:55,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-10-24 12:24:55,462 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 31 treesize of output 28 [2018-10-24 12:24:55,465 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-24 12:24:55,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,513 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 35 treesize of output 30 [2018-10-24 12:24:55,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 22 [2018-10-24 12:24:55,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:55,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:24:55,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:24:55,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:67, output treesize:46 [2018-10-24 12:24:55,784 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 36 treesize of output 31 [2018-10-24 12:24:55,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:55,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-24 12:24:55,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,839 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 29 treesize of output 26 [2018-10-24 12:24:55,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 12 treesize of output 11 [2018-10-24 12:24:55,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:55,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:24:55,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:40 [2018-10-24 12:24:56,146 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-24 12:24:56,148 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-24 12:24:56,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:56,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:56,150 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-24 12:24:56,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:24:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 2013 trivial. 0 not checked. [2018-10-24 12:24:56,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:32,823 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 37 treesize of output 35 [2018-10-24 12:25:32,826 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 35 treesize of output 39 [2018-10-24 12:25:32,830 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:32,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 54 [2018-10-24 12:25:32,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:32,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 42 treesize of output 76 [2018-10-24 12:25:32,989 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:33,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 109 [2018-10-24 12:25:35,093 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 467 DAG size of output: 335 [2018-10-24 12:25:35,105 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,108 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,112 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 92 [2018-10-24 12:25:35,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-10-24 12:25:35,212 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,362 INFO L303 Elim1Store]: Index analysis took 215 ms [2018-10-24 12:25:35,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 92 [2018-10-24 12:25:35,395 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-10-24 12:25:35,444 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:35,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-10-24 12:25:35,460 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:38,418 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:38,419 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:38,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 59 [2018-10-24 12:25:38,431 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:38,436 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:38,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:38,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:38,442 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:38,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 [2018-10-24 12:25:38,465 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-10-24 12:25:40,657 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:40,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:40,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2018-10-24 12:25:40,669 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:40,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:40,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:40,677 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:40,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:40,680 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:40,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:40,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 77 [2018-10-24 12:25:40,704 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-10-24 12:25:42,586 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:42,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:42,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:42,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 63 [2018-10-24 12:25:42,599 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:42,606 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:42,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-24 12:25:42,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:44,235 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:44,236 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:44,236 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:44,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:44,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 90 [2018-10-24 12:25:44,266 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 6 xjuncts. [2018-10-24 12:25:44,271 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:44,271 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 60 [2018-10-24 12:25:44,290 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:45,913 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:45,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:45,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-10-24 12:25:45,920 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:45,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:45,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:45,926 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:45,927 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:45,929 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:45,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:45,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 73 [2018-10-24 12:25:45,941 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:51,596 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:51,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-24 12:25:51,599 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:51,605 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:51,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-10-24 12:25:51,624 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-10-24 12:25:52,983 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:52,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:53,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2018-10-24 12:25:53,015 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-10-24 12:25:53,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:53,035 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:53,062 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:53,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:53,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 106 [2018-10-24 12:25:53,112 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:25:53,117 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 14 xjuncts. [2018-10-24 12:25:54,551 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:54,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 77 [2018-10-24 12:25:54,599 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 16 xjuncts. [2018-10-24 12:25:54,606 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:54,609 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:54,616 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:54,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 115 [2018-10-24 12:25:54,664 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-24 12:25:54,688 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 96 xjuncts. [2018-10-24 12:25:57,558 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:57,570 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:57,583 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:57,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:57,637 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:57,643 INFO L303 Elim1Store]: Index analysis took 159 ms [2018-10-24 12:25:57,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 88 [2018-10-24 12:25:57,666 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-10-24 12:25:57,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:57,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 64 [2018-10-24 12:25:57,701 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-10-24 12:25:59,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:59,184 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:59,194 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:59,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2018-10-24 12:25:59,249 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-24 12:25:59,294 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 208 xjuncts. [2018-10-24 12:25:59,364 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:59,505 INFO L303 Elim1Store]: Index analysis took 209 ms [2018-10-24 12:25:59,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 82 [2018-10-24 12:25:59,539 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-10-24 12:26:03,860 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:03,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 86 [2018-10-24 12:26:03,893 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:03,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 44 [2018-10-24 12:26:03,920 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-24 12:26:04,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2018-10-24 12:26:05,001 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-10-24 12:26:05,009 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:05,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 95 [2018-10-24 12:26:05,045 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 16 xjuncts. [2018-10-24 12:26:07,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-10-24 12:26:07,656 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 8 xjuncts. [2018-10-24 12:26:07,662 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:07,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:07,670 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:07,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 91 [2018-10-24 12:26:07,696 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 6 xjuncts. [2018-10-24 12:26:08,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 20 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-24 12:26:08,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:08,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 43 treesize of output 77 [2018-10-24 12:26:08,970 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-24 12:26:08,977 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:08,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-10-24 12:26:08,996 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:08,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:09,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-24 12:26:09,001 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:09,006 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:09,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-10-24 12:26:09,025 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:09,199 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:09,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-24 12:26:09,201 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:09,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:09,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 70 [2018-10-24 12:26:09,226 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:10,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:10,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-10-24 12:26:10,415 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:10,423 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:10,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 101 [2018-10-24 12:26:10,469 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 32 xjuncts. [2018-10-24 12:26:10,779 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-10-24 12:26:11,535 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 43 treesize of output 77 [2018-10-24 12:26:11,699 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-24 12:26:11,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,707 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 64 [2018-10-24 12:26:11,716 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-10-24 12:26:11,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 64 [2018-10-24 12:26:11,732 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-10-24 12:26:11,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-24 12:26:11,741 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:11,893 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-24 12:26:11,896 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:11,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:11,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71 [2018-10-24 12:26:11,924 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:12,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:12,112 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:12,118 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:12,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 98 [2018-10-24 12:26:12,150 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 14 xjuncts. [2018-10-24 12:26:12,159 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:12,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 58 [2018-10-24 12:26:12,178 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:12,378 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:26:12,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 14 xjuncts. [2018-10-24 12:26:12,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-24 12:26:13,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-24 12:26:13,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-24 12:26:13,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-10-24 12:26:13,552 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 11 variables, input treesize:77, output treesize:715 [2018-10-24 12:26:13,981 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 20 [2018-10-24 12:26:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 2013 trivial. 0 not checked. [2018-10-24 12:26:14,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:14,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 18] total 44 [2018-10-24 12:26:14,122 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:14,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 12:26:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 12:26:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1603, Unknown=19, NotChecked=0, Total=1892 [2018-10-24 12:26:14,124 INFO L87 Difference]: Start difference. First operand 205 states and 241 transitions. Second operand 29 states. [2018-10-24 12:26:18,328 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-10-24 12:26:22,132 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 12:26:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:25,121 INFO L93 Difference]: Finished difference Result 792 states and 967 transitions. [2018-10-24 12:26:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-24 12:26:25,122 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 200 [2018-10-24 12:26:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:25,127 INFO L225 Difference]: With dead ends: 792 [2018-10-24 12:26:25,127 INFO L226 Difference]: Without dead ends: 660 [2018-10-24 12:26:25,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8067 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=5734, Invalid=20007, Unknown=19, NotChecked=0, Total=25760 [2018-10-24 12:26:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-24 12:26:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 491. [2018-10-24 12:26:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-24 12:26:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 591 transitions. [2018-10-24 12:26:25,194 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 591 transitions. Word has length 200 [2018-10-24 12:26:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:25,194 INFO L481 AbstractCegarLoop]: Abstraction has 491 states and 591 transitions. [2018-10-24 12:26:25,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 12:26:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 591 transitions. [2018-10-24 12:26:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-24 12:26:25,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:25,196 INFO L375 BasicCegarLoop]: trace histogram [36, 33, 33, 32, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:25,196 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:25,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1882388856, now seen corresponding path program 1 times [2018-10-24 12:26:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:25,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:25,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 1066 proven. 242 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-24 12:26:25,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:25,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:25,485 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-24 12:26:25,485 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [43], [46], [48], [50], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:26:25,488 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:26:25,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:26:25,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:26:25,799 INFO L272 AbstractInterpreter]: Visited 36 different actions 156 times. Merged at 23 different actions 88 times. Widened at 2 different actions 7 times. Found 28 fixpoints after 12 different actions. Largest state had 63 variables. [2018-10-24 12:26:25,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:25,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:26:25,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:25,837 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-24 12:26:25,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:26:25,852 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:26:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:26,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 1066 proven. 242 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-24 12:26:26,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:26:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 1066 proven. 242 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-24 12:26:26,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:26,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2018-10-24 12:26:26,559 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:26,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:26:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:26:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=723, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:26:26,560 INFO L87 Difference]: Start difference. First operand 491 states and 591 transitions. Second operand 27 states. [2018-10-24 12:26:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:27,478 INFO L93 Difference]: Finished difference Result 910 states and 1110 transitions. [2018-10-24 12:26:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 12:26:27,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 212 [2018-10-24 12:26:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:27,484 INFO L225 Difference]: With dead ends: 910 [2018-10-24 12:26:27,484 INFO L226 Difference]: Without dead ends: 539 [2018-10-24 12:26:27,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=537, Invalid=723, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:26:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-24 12:26:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 523. [2018-10-24 12:26:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-24 12:26:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 631 transitions. [2018-10-24 12:26:27,545 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 631 transitions. Word has length 212 [2018-10-24 12:26:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:27,545 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 631 transitions. [2018-10-24 12:26:27,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:26:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 631 transitions. [2018-10-24 12:26:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-24 12:26:27,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:27,547 INFO L375 BasicCegarLoop]: trace histogram [39, 36, 36, 35, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:27,547 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:27,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1640371711, now seen corresponding path program 2 times [2018-10-24 12:26:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:26:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:27,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2879 backedges. 1258 proven. 288 refuted. 0 times theorem prover too weak. 1333 trivial. 0 not checked. [2018-10-24 12:26:28,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:28,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:28,215 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:28,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:26:28,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:28,215 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-24 12:26:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:26:28,223 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:26:29,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:26:29,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:26:29,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:29,103 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 14 treesize of output 17 [2018-10-24 12:26:29,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-24 12:26:29,264 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 12:26:29,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:29,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:29,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:29,372 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-10-24 12:26:29,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-24 12:26:29,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:29,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:29,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:29,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:29,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-10-24 12:26:32,454 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-24 12:26:32,762 INFO L303 Elim1Store]: Index analysis took 301 ms [2018-10-24 12:26:32,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 113 [2018-10-24 12:26:33,162 INFO L303 Elim1Store]: Index analysis took 386 ms [2018-10-24 12:26:33,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 101 treesize of output 271 [2018-10-24 12:26:33,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:26:33,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 27 xjuncts. [2018-10-24 12:26:34,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-24 12:26:34,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 24 dim-0 vars, and 7 xjuncts. [2018-10-24 12:26:34,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:141, output treesize:776 [2018-10-24 12:27:35,755 WARN L179 SmtUtils]: Spent 59.01 s on a formula simplification that was a NOOP. DAG size: 220 [2018-10-24 12:28:13,202 WARN L179 SmtUtils]: Spent 31.18 s on a formula simplification that was a NOOP. DAG size: 275 [2018-10-24 12:28:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2879 backedges. 1215 proven. 192 refuted. 0 times theorem prover too weak. 1472 trivial. 0 not checked. [2018-10-24 12:28:13,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:14,589 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:28:14,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:14,590 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-24 12:28:14,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:109, output treesize:1 [2018-10-24 12:28:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2879 backedges. 1360 proven. 69 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-10-24 12:28:14,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:14,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 11] total 33 [2018-10-24 12:28:14,775 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:14,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-24 12:28:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-24 12:28:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=783, Unknown=5, NotChecked=0, Total=1056 [2018-10-24 12:28:14,776 INFO L87 Difference]: Start difference. First operand 523 states and 631 transitions. Second operand 24 states. [2018-10-24 12:28:27,466 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 54 Received shutdown request... [2018-10-24 12:28:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:28:31,807 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:28:31,811 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:28:31,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:28:31 BoogieIcfgContainer [2018-10-24 12:28:31,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:28:31,812 INFO L168 Benchmark]: Toolchain (without parser) took 255299.82 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:31,813 INFO L168 Benchmark]: CDTParser took 1.92 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-24 12:28:31,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:31,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:28:31,813 INFO L168 Benchmark]: Boogie Preprocessor took 102.31 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-24 12:28:31,814 INFO L168 Benchmark]: RCFGBuilder took 1286.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -716.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:31,814 INFO L168 Benchmark]: TraceAbstraction took 253340.65 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 333.4 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -323.2 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:31,816 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.92 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 439.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 122.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.31 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. * RCFGBuilder took 1286.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -716.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253340.65 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 333.4 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -323.2 MB). Peak memory consumption was 10.3 MB. 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 (523states) and FLOYD_HOARE automaton (currently 8 states, 24 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. TIMEOUT Result, 253.2s OverallTime, 21 OverallIterations, 39 TraceHistogramMax, 47.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 705 SDtfs, 5362 SDslu, 3813 SDs, 0 SdLazy, 3011 SolverSat, 1544 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 26.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 4598 GetRequests, 3918 SyntacticMatches, 19 SemanticMatches, 660 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16034 ImplicationChecksByTransitivity, 167.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.8464603974096419 AbsIntWeakeningRatio, 1.7752808988764044 AbsIntAvgWeakeningVarsNumRemoved, -1.6292134831460674 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 833 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 197.0s InterpolantComputationTime, 4163 NumberOfCodeBlocks, 3732 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6126 ConstructedInterpolants, 124 QuantifiedInterpolants, 5628008 SizeOfPredicates, 106 NumberOfNonLiveVariables, 7628 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 53 InterpolantComputations, 4 PerfectInterpolantSequences, 37755/42334 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown