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/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:37:39,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:37:39,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:37:39,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:37:39,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:37:39,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:37:39,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:37:39,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:37:39,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:37:39,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:37:39,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:37:39,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:37:39,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:37:39,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:37:39,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:37:39,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:37:39,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:37:39,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:37:39,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:37:39,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:37:39,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:37:39,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:37:39,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:37:39,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:37:39,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:37:39,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:37:39,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:37:39,923 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:37:39,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:37:39,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:37:39,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:37:39,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:37:39,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:37:39,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:37:39,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:37:39,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:37:39,928 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:37:39,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:37:39,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:37:39,957 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:37:39,958 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:37:39,958 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:37:39,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:37:39,958 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:37:39,959 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:37:39,959 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:37:39,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:37:39,960 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:37:39,960 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:37:39,960 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:37:39,960 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:37:39,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:37:39,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:37:39,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:37:39,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:37:39,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:37:39,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:37:39,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:37:39,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:37:39,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:37:39,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:37:39,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:37:39,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:37:39,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:37:39,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:37:39,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:37:39,967 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:37:39,967 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:37:39,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:37:39,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:37:39,968 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:37:39,968 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:37:39,968 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:37:40,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:37:40,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:37:40,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:37:40,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:37:40,047 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:37:40,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-24 12:37:40,104 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9741ea269/92254b8d33b84f3fa6dce36000b73f72/FLAGe5181495c [2018-10-24 12:37:40,539 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:37:40,540 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-24 12:37:40,546 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9741ea269/92254b8d33b84f3fa6dce36000b73f72/FLAGe5181495c [2018-10-24 12:37:40,560 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9741ea269/92254b8d33b84f3fa6dce36000b73f72 [2018-10-24 12:37:40,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:37:40,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:37:40,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:37:40,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:37:40,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:37:40,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a216523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40, skipping insertion in model container [2018-10-24 12:37:40,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:37:40,615 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:37:40,832 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:37:40,843 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:37:40,861 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:37:40,878 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:37:40,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40 WrapperNode [2018-10-24 12:37:40,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:37:40,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:37:40,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:37:40,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:37:40,889 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:37:40" (1/1) ... [2018-10-24 12:37:40,898 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:37:40" (1/1) ... [2018-10-24 12:37:40,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:37:40,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:37:40,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:37:40,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:37:40,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (1/1) ... [2018-10-24 12:37:40,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:37:40,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:37:40,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:37:40,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:37:40,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (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:37:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:37:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:37:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:37:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:37:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:37:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:37:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:37:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:37:41,435 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:37:41,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:37:41 BoogieIcfgContainer [2018-10-24 12:37:41,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:37:41,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:37:41,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:37:41,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:37:41,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:37:40" (1/3) ... [2018-10-24 12:37:41,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127a2882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:37:41, skipping insertion in model container [2018-10-24 12:37:41,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:40" (2/3) ... [2018-10-24 12:37:41,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127a2882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:37:41, skipping insertion in model container [2018-10-24 12:37:41,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:37:41" (3/3) ... [2018-10-24 12:37:41,444 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-24 12:37:41,454 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:37:41,463 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:37:41,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:37:41,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:37:41,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:37:41,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:37:41,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:37:41,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:37:41,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:37:41,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:37:41,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:37:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-10-24 12:37:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:37:41,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:41,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:41,544 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:41,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 235483989, now seen corresponding path program 1 times [2018-10-24 12:37:41,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:41,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:41,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:41,689 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:37:41,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:37:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:37:41,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:37:41,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:37:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:37:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:37:41,716 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-10-24 12:37:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:41,740 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-10-24 12:37:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:37:41,741 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-24 12:37:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:41,749 INFO L225 Difference]: With dead ends: 44 [2018-10-24 12:37:41,750 INFO L226 Difference]: Without dead ends: 22 [2018-10-24 12:37:41,753 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:37:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-24 12:37:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-24 12:37:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-24 12:37:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-10-24 12:37:41,792 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-10-24 12:37:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:41,793 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-10-24 12:37:41,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:37:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-10-24 12:37:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:37:41,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:41,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:41,795 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:41,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1613839314, now seen corresponding path program 1 times [2018-10-24 12:37:41,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:41,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:41,797 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:42,175 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:37:42,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:37:42,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:37:42,176 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:37:42,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:37:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:37:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:37:42,181 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-10-24 12:37:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:42,359 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-10-24 12:37:42,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:37:42,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-24 12:37:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:42,361 INFO L225 Difference]: With dead ends: 39 [2018-10-24 12:37:42,361 INFO L226 Difference]: Without dead ends: 25 [2018-10-24 12:37:42,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:37:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-24 12:37:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-24 12:37:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-24 12:37:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-10-24 12:37:42,370 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-10-24 12:37:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:42,370 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-10-24 12:37:42,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:37:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-10-24 12:37:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 12:37:42,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:42,372 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:42,372 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:42,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1557204615, now seen corresponding path program 1 times [2018-10-24 12:37:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:42,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:42,691 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-24 12:37:42,874 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 12:37:42,949 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:37:42,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:42,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:42,951 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-24 12:37:42,953 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [16], [18], [20], [24], [28], [33], [43], [46], [48], [54], [55], [56], [58] [2018-10-24 12:37:42,995 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:37:42,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:37:43,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:37:43,341 INFO L272 AbstractInterpreter]: Visited 18 different actions 50 times. Merged at 7 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-10-24 12:37:43,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:43,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:37:43,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:43,400 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:37:43,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:43,420 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:37:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:43,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:43,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-24 12:37:43,727 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:37:43,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:43,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:43,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:43,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-24 12:37:43,900 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:37:43,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-24 12:37:43,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:43,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:43,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:43,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:37:43,980 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:37:43,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:44,201 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 14 treesize of output 12 [2018-10-24 12:37:44,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-24 12:37:44,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:44,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:44,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:44,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5 [2018-10-24 12:37:44,324 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:37:44,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2018-10-24 12:37:44,359 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:44,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:37:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:37:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:37:44,365 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-10-24 12:37:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:44,778 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-10-24 12:37:44,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:37:44,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-10-24 12:37:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:44,780 INFO L225 Difference]: With dead ends: 36 [2018-10-24 12:37:44,780 INFO L226 Difference]: Without dead ends: 34 [2018-10-24 12:37:44,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:37:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-24 12:37:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-24 12:37:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-24 12:37:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-24 12:37:44,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 19 [2018-10-24 12:37:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:44,791 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-24 12:37:44,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:37:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-24 12:37:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 12:37:44,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:44,794 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:44,794 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:44,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1892261924, now seen corresponding path program 1 times [2018-10-24 12:37:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:44,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:44,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:44,797 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:37:44,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:44,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:44,911 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-24 12:37:44,912 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [16], [18], [20], [24], [28], [33], [35], [37], [43], [46], [48], [51], [53], [54], [55], [56], [58], [59] [2018-10-24 12:37:44,914 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:37:44,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:37:45,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:37:45,182 INFO L272 AbstractInterpreter]: Visited 23 different actions 96 times. Merged at 10 different actions 40 times. Widened at 1 different actions 5 times. Found 5 fixpoints after 2 different actions. Largest state had 35 variables. [2018-10-24 12:37:45,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:45,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:37:45,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:45,225 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:37:45,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:45,237 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:37:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:45,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:37:45,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:37:45,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:45,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-24 12:37:45,584 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:45,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:37:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:37:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:37:45,585 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-10-24 12:37:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:45,753 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-10-24 12:37:45,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:37:45,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-10-24 12:37:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:45,759 INFO L225 Difference]: With dead ends: 54 [2018-10-24 12:37:45,760 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:37:45,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:37:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:37:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-24 12:37:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-24 12:37:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-24 12:37:45,773 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2018-10-24 12:37:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:45,773 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-24 12:37:45,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:37:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-24 12:37:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 12:37:45,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:45,775 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:45,775 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:45,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2043007747, now seen corresponding path program 2 times [2018-10-24 12:37:45,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:45,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:45,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:45,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:45,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:37:46,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:46,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:46,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:46,163 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:37:46,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:46,163 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:37:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:37:46,175 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:37:46,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:37:46,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:37:46,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:46,321 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 13 treesize of output 10 [2018-10-24 12:37:46,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:37:46,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-24 12:37:46,558 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:37:46,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-24 12:37:46,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,609 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:37:46,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:37:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:37:46,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:46,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-24 12:37:46,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-24 12:37:46,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:46,811 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:37:46,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-10-24 12:37:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:37:46,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:46,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 20 [2018-10-24 12:37:46,856 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:46,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:37:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:37:46,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:37:46,858 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 19 states. [2018-10-24 12:37:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:47,385 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-10-24 12:37:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 12:37:47,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-10-24 12:37:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:47,387 INFO L225 Difference]: With dead ends: 48 [2018-10-24 12:37:47,387 INFO L226 Difference]: Without dead ends: 46 [2018-10-24 12:37:47,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:37:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-24 12:37:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-10-24 12:37:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-24 12:37:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-24 12:37:47,396 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-10-24 12:37:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:47,397 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-24 12:37:47,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:37:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-24 12:37:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:37:47,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:47,398 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:47,398 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:47,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash -43804270, now seen corresponding path program 3 times [2018-10-24 12:37:47,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:47,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:37:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:47,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:47,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:47,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:47,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:47,570 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:37:47,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:47,571 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:37:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:37:47,579 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:37:47,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:37:47,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:37:47,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:47,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:47,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:47,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-10-24 12:37:47,784 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:47,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:37:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:37:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:37:47,787 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 13 states. [2018-10-24 12:37:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:48,082 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-10-24 12:37:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:37:48,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-10-24 12:37:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:48,084 INFO L225 Difference]: With dead ends: 71 [2018-10-24 12:37:48,084 INFO L226 Difference]: Without dead ends: 47 [2018-10-24 12:37:48,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:37:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-24 12:37:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-24 12:37:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-24 12:37:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-24 12:37:48,094 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-10-24 12:37:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:48,095 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-24 12:37:48,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:37:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-24 12:37:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 12:37:48,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:48,096 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:48,097 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1152087495, now seen corresponding path program 4 times [2018-10-24 12:37:48,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:48,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:37:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:48,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 12:37:48,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:48,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:48,377 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:48,377 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:37:48,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:48,377 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:37:48,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:48,387 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:37:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:48,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:48,477 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:37:48,495 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:37:48,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:48,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:48,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:37:48,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-10-24 12:37:56,699 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 21 treesize of output 17 [2018-10-24 12:37:56,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:37:56,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:37:56,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:56,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:56,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:56,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-10-24 12:37:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:56,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:58,952 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 13 [2018-10-24 12:37:58,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-24 12:37:58,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:37:58,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:58,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:37:58,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-10-24 12:37:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:59,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:59,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 19 [2018-10-24 12:37:59,013 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:59,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:37:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:37:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=292, Unknown=3, NotChecked=0, Total=342 [2018-10-24 12:37:59,015 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2018-10-24 12:38:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:38:03,485 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-10-24 12:38:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 12:38:03,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-10-24 12:38:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:38:03,487 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:38:03,488 INFO L226 Difference]: Without dead ends: 58 [2018-10-24 12:38:03,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=108, Invalid=645, Unknown=3, NotChecked=0, Total=756 [2018-10-24 12:38:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-24 12:38:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-10-24 12:38:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:38:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-24 12:38:03,502 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 43 [2018-10-24 12:38:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:38:03,503 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-24 12:38:03,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:38:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-24 12:38:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:38:03,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:38:03,506 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:38:03,509 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:38:03,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:38:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1561288932, now seen corresponding path program 5 times [2018-10-24 12:38:03,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:38:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:38:03,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:03,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:38:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:38:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:38:03,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:03,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:38:03,887 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:38:03,887 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:38:03,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:03,887 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:38:03,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:38:03,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:38:03,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:38:03,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:38:03,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:38:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:38:04,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:38:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:38:04,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:38:04,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-10-24 12:38:04,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:38:04,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:38:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:38:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:38:04,472 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 16 states. [2018-10-24 12:38:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:38:04,744 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-10-24 12:38:04,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:38:04,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-24 12:38:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:38:04,746 INFO L225 Difference]: With dead ends: 88 [2018-10-24 12:38:04,746 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 12:38:04,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:38:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 12:38:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-24 12:38:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-24 12:38:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-10-24 12:38:04,755 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-10-24 12:38:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:38:04,756 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-10-24 12:38:04,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:38:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-10-24 12:38:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 12:38:04,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:38:04,757 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:38:04,757 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:38:04,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:38:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1718799683, now seen corresponding path program 6 times [2018-10-24 12:38:04,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:38:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:04,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:38:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:04,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:38:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:38:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:38:05,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:05,203 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:38:05,203 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:38:05,204 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:38:05,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:05,204 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:38:05,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:38:05,211 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:38:05,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:38:05,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:38:05,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:38:05,277 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:38:05,279 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:38:05,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:05,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:05,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:38:05,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-10-24 12:38:21,730 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 21 treesize of output 17 [2018-10-24 12:38:21,756 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:38:21,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:38:21,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:21,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:21,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:21,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-10-24 12:38:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:38:21,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:38:22,494 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 18 treesize of output 16 [2018-10-24 12:38:22,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-10-24 12:38:22,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:22,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:22,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:22,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2018-10-24 12:38:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:38:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:38:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 22 [2018-10-24 12:38:22,620 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:38:22,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:38:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:38:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=402, Unknown=4, NotChecked=0, Total=462 [2018-10-24 12:38:22,622 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 21 states. [2018-10-24 12:38:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:38:29,291 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-10-24 12:38:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 12:38:29,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-24 12:38:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:38:29,293 INFO L225 Difference]: With dead ends: 72 [2018-10-24 12:38:29,293 INFO L226 Difference]: Without dead ends: 70 [2018-10-24 12:38:29,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 89 SyntacticMatches, 20 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=125, Invalid=863, Unknown=4, NotChecked=0, Total=992 [2018-10-24 12:38:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-24 12:38:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-24 12:38:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-24 12:38:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-24 12:38:29,302 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 55 [2018-10-24 12:38:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:38:29,303 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-24 12:38:29,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:38:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-24 12:38:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 12:38:29,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:38:29,305 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:38:29,305 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:38:29,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:38:29,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1561077586, now seen corresponding path program 7 times [2018-10-24 12:38:29,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:38:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:29,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:38:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:29,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:38:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:38:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:38:29,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:29,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:38:29,462 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:38:29,463 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:38:29,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:29,463 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:38:29,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:38:29,476 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:38:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:38:29,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:38:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:38:29,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:38:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:38:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:38:29,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2018-10-24 12:38:29,754 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:38:29,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:38:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:38:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:38:29,755 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 19 states. [2018-10-24 12:38:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:38:30,008 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-10-24 12:38:30,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:38:30,008 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-10-24 12:38:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:38:30,009 INFO L225 Difference]: With dead ends: 105 [2018-10-24 12:38:30,010 INFO L226 Difference]: Without dead ends: 71 [2018-10-24 12:38:30,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:38:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-24 12:38:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-24 12:38:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-24 12:38:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-24 12:38:30,019 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2018-10-24 12:38:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:38:30,019 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-24 12:38:30,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:38:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-24 12:38:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 12:38:30,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:38:30,021 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:38:30,021 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:38:30,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:38:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash -827370759, now seen corresponding path program 8 times [2018-10-24 12:38:30,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:38:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:30,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:38:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:30,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:38:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:38:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 92 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-24 12:38:30,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:30,489 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:38:30,489 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:38:30,489 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:38:30,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:30,489 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:38:30,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:38:30,506 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:38:30,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:38:30,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:38:30,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:38:30,687 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:38:30,689 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:38:30,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:30,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:30,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:30,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-24 12:38:31,807 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 23 treesize of output 19 [2018-10-24 12:38:31,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:38:31,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:38:31,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:31,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:31,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:31,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-10-24 12:38:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 38 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:38:31,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:38:32,340 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 18 treesize of output 16 [2018-10-24 12:38:32,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-10-24 12:38:32,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:32,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:32,365 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:38:32,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-10-24 12:38:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 38 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:38:32,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:38:32,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 41 [2018-10-24 12:38:32,549 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:38:32,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 12:38:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 12:38:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 12:38:32,551 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 33 states. [2018-10-24 12:38:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:38:47,845 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-10-24 12:38:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-24 12:38:47,845 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2018-10-24 12:38:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:38:47,846 INFO L225 Difference]: With dead ends: 119 [2018-10-24 12:38:47,847 INFO L226 Difference]: Without dead ends: 85 [2018-10-24 12:38:47,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 99 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=598, Invalid=5101, Unknown=1, NotChecked=0, Total=5700 [2018-10-24 12:38:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-24 12:38:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-24 12:38:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-24 12:38:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-10-24 12:38:47,859 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 67 [2018-10-24 12:38:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:38:47,860 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-10-24 12:38:47,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 12:38:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-10-24 12:38:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 12:38:47,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:38:47,861 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:38:47,861 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:38:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:38:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash -83912829, now seen corresponding path program 9 times [2018-10-24 12:38:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:38:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:47,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:38:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:38:47,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:38:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:38:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 9 proven. 135 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 12:38:48,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:48,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:38:48,207 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:38:48,207 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:38:48,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:38:48,207 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:38:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:38:48,215 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:38:48,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:38:48,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:38:48,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:38:48,303 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:38:48,304 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:38:48,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:38:48,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:38:48,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:38:48,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-24 12:39:39,060 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 19 treesize of output 15 [2018-10-24 12:39:39,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-24 12:39:39,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:39:39,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:39,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:39,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-24 12:39:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:39:39,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:39:41,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-24 12:39:41,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-24 12:39:41,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:39:41,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:41,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:41,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-10-24 12:39:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 122 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:39:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:39:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 28 [2018-10-24 12:39:41,321 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:39:41,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:39:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:39:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=676, Unknown=6, NotChecked=0, Total=756 [2018-10-24 12:39:41,324 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 27 states. [2018-10-24 12:39:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:39:52,286 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-10-24 12:39:52,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 12:39:52,286 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-10-24 12:39:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:39:52,288 INFO L225 Difference]: With dead ends: 96 [2018-10-24 12:39:52,288 INFO L226 Difference]: Without dead ends: 94 [2018-10-24 12:39:52,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 131 SyntacticMatches, 22 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=159, Invalid=1395, Unknown=6, NotChecked=0, Total=1560 [2018-10-24 12:39:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-24 12:39:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-24 12:39:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-24 12:39:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-24 12:39:52,302 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 79 [2018-10-24 12:39:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:39:52,302 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-24 12:39:52,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:39:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-24 12:39:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 12:39:52,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:39:52,304 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:39:52,304 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:39:52,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:39:52,304 INFO L82 PathProgramCache]: Analyzing trace with hash 731833618, now seen corresponding path program 10 times [2018-10-24 12:39:52,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:39:52,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:39:52,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:39:52,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:39:52,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:39:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:39:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 78 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:39:52,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:39:52,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:39:52,610 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:39:52,610 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:39:52,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:39:52,610 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:39:52,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:39:52,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:39:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:39:52,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:39:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 105 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:39:52,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:39:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 105 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:39:52,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:39:52,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2018-10-24 12:39:52,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:39:52,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 12:39:52,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 12:39:52,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:39:52,939 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 25 states. [2018-10-24 12:39:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:39:53,234 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-10-24 12:39:53,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:39:53,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-10-24 12:39:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:39:53,235 INFO L225 Difference]: With dead ends: 139 [2018-10-24 12:39:53,235 INFO L226 Difference]: Without dead ends: 95 [2018-10-24 12:39:53,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 155 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:39:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-24 12:39:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-24 12:39:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-24 12:39:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-10-24 12:39:53,247 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 88 [2018-10-24 12:39:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:39:53,247 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-10-24 12:39:53,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 12:39:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-10-24 12:39:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 12:39:53,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:39:53,249 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:39:53,249 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:39:53,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:39:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash -55358535, now seen corresponding path program 11 times [2018-10-24 12:39:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:39:53,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:39:53,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:39:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:39:53,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:39:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:39:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 11 proven. 186 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-24 12:39:54,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:39:54,219 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:39:54,219 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:39:54,219 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:39:54,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:39:54,219 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:39:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:39:54,228 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:39:54,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-24 12:39:54,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:39:54,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:39:54,440 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:39:54,441 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:39:54,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:39:54,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:54,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:54,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-24 12:39:59,896 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 23 treesize of output 19 [2018-10-24 12:39:59,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:39:59,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:39:59,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:39:59,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:59,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:39:59,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-10-24 12:40:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 87 proven. 95 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:40:00,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:40:03,843 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 18 treesize of output 16 [2018-10-24 12:40:03,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-10-24 12:40:03,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:40:03,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:03,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:03,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-10-24 12:40:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 87 proven. 95 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:40:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:40:04,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 22] total 51 [2018-10-24 12:40:04,041 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:40:04,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 12:40:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 12:40:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2268, Unknown=1, NotChecked=0, Total=2550 [2018-10-24 12:40:04,043 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 41 states. [2018-10-24 12:40:06,026 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-10-24 12:40:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:40:17,503 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-10-24 12:40:17,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-24 12:40:17,503 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2018-10-24 12:40:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:40:17,505 INFO L225 Difference]: With dead ends: 160 [2018-10-24 12:40:17,505 INFO L226 Difference]: Without dead ends: 120 [2018-10-24 12:40:17,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 135 SyntacticMatches, 21 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=869, Invalid=8249, Unknown=2, NotChecked=0, Total=9120 [2018-10-24 12:40:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-24 12:40:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2018-10-24 12:40:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-24 12:40:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-10-24 12:40:17,518 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 91 [2018-10-24 12:40:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:40:17,518 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-10-24 12:40:17,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 12:40:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-10-24 12:40:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 12:40:17,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:40:17,520 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:40:17,520 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:40:17,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:40:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash 762851779, now seen corresponding path program 12 times [2018-10-24 12:40:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:40:17,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:40:17,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:40:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:40:17,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:40:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:40:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 13 proven. 245 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 12:40:18,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:40:18,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:40:18,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:40:18,112 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:40:18,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:40:18,112 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:40:18,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:40:18,124 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:40:18,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:40:18,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:40:18,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:40:18,521 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:40:18,525 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:40:18,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:40:18,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:18,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:18,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-24 12:40:28,090 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 23 treesize of output 19 [2018-10-24 12:40:28,092 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:40:28,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:40:28,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:40:28,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:28,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:28,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-10-24 12:40:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 38 proven. 202 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:40:28,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:40:31,383 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 18 treesize of output 16 [2018-10-24 12:40:31,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-10-24 12:40:31,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:40:31,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:31,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:31,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-10-24 12:40:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 119 proven. 121 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:40:31,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:40:31,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 24] total 56 [2018-10-24 12:40:31,721 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:40:31,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-24 12:40:31,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-24 12:40:31,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2762, Unknown=1, NotChecked=0, Total=3080 [2018-10-24 12:40:31,723 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 42 states. [2018-10-24 12:40:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:40:47,111 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-10-24 12:40:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-24 12:40:47,111 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 103 [2018-10-24 12:40:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:40:47,113 INFO L225 Difference]: With dead ends: 178 [2018-10-24 12:40:47,113 INFO L226 Difference]: Without dead ends: 121 [2018-10-24 12:40:47,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 154 SyntacticMatches, 24 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2959 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=1020, Invalid=11411, Unknown=1, NotChecked=0, Total=12432 [2018-10-24 12:40:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-24 12:40:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-10-24 12:40:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-24 12:40:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-10-24 12:40:47,130 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 103 [2018-10-24 12:40:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:40:47,130 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-10-24 12:40:47,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-24 12:40:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-10-24 12:40:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:40:47,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:40:47,131 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:40:47,131 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:40:47,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:40:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -808160135, now seen corresponding path program 13 times [2018-10-24 12:40:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:40:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:40:47,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:40:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:40:47,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:40:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:40:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 12:40:47,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:40:47,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:40:47,702 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:40:47,702 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:40:47,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:40:47,702 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:40:47,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:40:47,712 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:40:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:40:47,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:40:47,791 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:40:47,797 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:40:47,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:40:47,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:40:47,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:40:47,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 Received shutdown request... [2018-10-24 12:42:20,747 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:42:20,948 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:42:20,948 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:42:20,953 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:42:20,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:42:20 BoogieIcfgContainer [2018-10-24 12:42:20,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:42:20,954 INFO L168 Benchmark]: Toolchain (without parser) took 280382.81 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 935.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.3 MB). Peak memory consumption was 144.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:42:20,955 INFO L168 Benchmark]: CDTParser took 0.19 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:42:20,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.56 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:42:20,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.42 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:42:20,956 INFO L168 Benchmark]: Boogie Preprocessor took 23.56 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:42:20,957 INFO L168 Benchmark]: RCFGBuilder took 497.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-10-24 12:42:20,957 INFO L168 Benchmark]: TraceAbstraction took 279516.65 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 190.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -6.0 MB). Peak memory consumption was 184.4 MB. Max. memory is 7.1 GB. [2018-10-24 12:42:20,963 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 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 305.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.42 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 23.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 497.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 279516.65 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 190.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -6.0 MB). Peak memory consumption was 184.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 279.4s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 68.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 446 SDtfs, 737 SDslu, 4509 SDs, 0 SdLazy, 5879 SolverSat, 540 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 50.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1929 GetRequests, 1239 SyntacticMatches, 168 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8066 ImplicationChecksByTransitivity, 128.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 41 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 114.2s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2270 ConstructedInterpolants, 309 QuantifiedInterpolants, 1143862 SizeOfPredicates, 161 NumberOfNonLiveVariables, 2811 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 1937/4140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown